Integrated scheduling and binding: a synthesis approach for design space exploration

ABSTRACT

Synthesis of digital systems, involves a number of tasks ranging from scheduling to generating interconnections. The interrelationship between these tasks implies that good designs can only be generated by considering the overall impact of a design decision. The approach presented in this paper provides a framework for integrating scheduling decisions with binding decisions. The methodology supports allocation of a wider mix of operator modules and covers the design space more effectively. The process itself can be described as incremental synthesis and is thus well-suited for applications involving partial pre-synthesized structures.

REFERENCES

• 1: C-J. Tseng and D.P.Siewiorek,"Automated Synthesis of DataPaths in Digital Systems", IEEE Trans. Computer-Aided Design, Vol. CAD-5, No.3, pp. 379-395, July 1986.
• 2: Peter Marwedel, The mimola design system: Tools for the design of digital processors, Proceedings of the 21st conference on Design automation, p.587-593, June 25-27, 1984, Albuquerque, New Mexico, United States
• 3: Peter Marwedel, The mimola design system: Tools for the design of digital processors, Proceedings of the 21st conference on Design automation, p.587-593, June 25-27, 1984, Albuquerque, New Mexico, United States
• 4: P. G. Paulin , J. P. Knight , E. F. Girczyc, HAL: a multi-paradigm approach to automatic data path synthesis, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.263-270, July 1986, Las Vegas, Nevada, United States
• 5: P. G. Paulin , J. P. Knight, Force-directed scheduling in automatic data path synthesis, Proceedings of the 24th ACM/IEEE conference on Design automation, p.195-202, June 28-July 01, 1987, Miami Beach, Florida, United States [doi>10.1145/37888.37918]
• 6: P. Pfahler, Automated datapath synthesis: A compilation approach, Microprocessing and Microprogramming, v.21 n.1-5, p.577-584, Aug. 1987 [doi>10.1016/0165-6074(87)90093-7]
• 7: Alice C. Parker , Jorge T. Pizarro , Mitch Mlinar, MAHA: a program for datapath synthesis, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.461-466, July 1986, Las Vegas, Nevada, United States
• 8: Barry M. Pangre, Splicer: a heuristic approach to connectivity binding, Proceedings of the 25th ACM/IEEE conference on Design automation, p.536-541, June 12-15, 1988, Atlantic City, New Jersey, United States
• 9: Z. Peng, "A Formal methodology for Automated Synthesis of VLSI Systems", Ph.D. Dissertation, Linkoping University, Linkoping, Sweden, 1987.
• 10: John J. Granacki , Alice C. Parker, The effect of register-transfer design tradeoffs on chip area and performance, Proceedings of the 20th conference on Design automation, p.419-424, June 27-29, 1983, Miami Beach, Florida, United States
• 11: R.Jain,M.J~Mlinar and A.C.Parker, "Area- Time Model for Synthesis of Non-Pipelined Designs", ICCAD-88,Nov.1988o
• 12: M.C.McFarland, "Reevaluatinc! the Design Space for Register-Transfer Hardware Synthesis" ICCAD-87, 1987
• 13: Rajiv Jain , Alice Parker , Nohbyung Park, Module selection for pipelined synthesis, Proceedings of the 25th ACM/IEEE conference on Design automation, p.542-547, June 12-15, 1988, Atlantic City, New Jersey, United States
• 14: M. Balakrishnan et al. , "Allocation of Multi-port Memories in Data Path Synthesis", IEEE Trans. Computer-Aided Design, Vol. 7, No. 4, April 1988, pp. 536-547.
• 15: Nohbyung Park , Alice Parker, Sehwa: a program for synthesis of pipelines, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.454-460, July 1986, Las Vegas, Nevada, United States
• 16: R.Johnk and P.Marwedel, MIMOLA Reference Manual, Vers ion 3.5, Institut fur informatik, Univ. of Kiel, Kiel, W.Germany.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.0 GENERAL
      Subjects: Systems specification methodology

Additional Classification:
  B. Hardware
  B.4 INPUT/OUTPUT AND DATA COMMUNICATIONS
  B.5 REGISTER-TRANSFER-LEVEL IMPLEMENTATION
      B.5.2 Design Aids
          Subjects: Automatic synthesis

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

General Terms:
Algorithms, Design, Performance, Theory