A linear program driven scheduling and allocation method followed by an interconnect optimization algorithm

ABSTRACT

A new method for high level synthesis is reported whose basic feature is the tight interaction and coupling of the scheduling and allocation phases providing a global direction to synthesis. A linear program based allocation is proposed which uses multifunction ALU cost estimation, and iteratively drives a tree search for scheduling. A major contribution of this paper is a new interconnect optimization algorithm which is based on several interconnect transformations for multiplexer input collapsing and merging. Several other important synthesis aspects are included, e.g. register and interconnect bindings, operation chaining and operation multicycling. The method has been implemented in C on a Sun 3/60,

REFERENCES

• 1: Dantzig G.B., "Linear ProgrLmming and Extensiom", Princeton University Press, 1963.
• 2: Papachristou C., and H. Konulr, "A high level synthesis lechnique based on linear programming," 4th Intern. Workshop on High Level Synthesis, Oct. 1989, Tech. Repmt # CES-g9-21, Computer Engineering, Case Western Reserve University.
• 3: Abadir M., and M. A. Breuer, "A knowledge-based system for designing testable VLSI chips," IEEE DesigJt & Test, Vol. 2, August I985, pp. 56-68.
• 4: S. Y. Kung , Thomas Kailath , Harper J. Whitehouse, VLSI and Modern Signal Processing, Prentice Hall Professional Technical Reference, 1984
• 4: Michael C. McFarland , Alice C. Parker , Raul Camposano, Tutorial on high-level synthesis, Proceedings of the 25th ACM/IEEE conference on Design automation, p.330-336, June 12-15, 1988, Atlantic City, New Jersey, United States
• 6: 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
• 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: Paulin P.G., J.P. Knight, "Force-Directed Scheduling for the Behavioral Synthesis of ASICs", IEEE Trans. on CAD, pp. 661-679, June 1989.
• 9: 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
• 10: Chia-Jeng Tseng , Daniel P. Siewiorek, Facet: A procedure for the automated synthesis of digital systems, Proceedings of the 20th conference on Design automation, p.490-496, June 27-29, 1983, Miami Beach, Florida, United States
• 11: P. G. Paulin , J. P. Knight, Scheduling and binding algorithms for high-level synthesis, Proceedings of the 26th ACM/IEEE conference on Design automation, p.1-6, June 25-28, 1989, Las Vegas, Nevada, United States [doi>10.1145/74382.74383]
• 12: Hafer L., A. Parker, "A Formal Method for the Specification, Analysis and Design of Register-Transfer Level Digital Logic," IEEE Trans. on CAD, Vol. CAD-2, 1983, pp. 4-18.
• 13: Peter Marwedel, A new synthesis for the MIMOLA software system, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.271-277, July 1986, Las Vegas, Nevada, United States
• 14: Devadas S., A. Newton, "Algorithms for Hardware Allocation in Data Path Synthesis", IEEE Trans. on CAD, pp. 768-81 July 1989.
• 15: Prasad K.S., C. Eswaran, "I/mit-Cycle Free Complex Biquad Recursive Digital Filters', IEEE Tra,s. Circuits and Systems, Feb. 1989.
• 16: Turner L.E., B.K. Rame~h, "Low Sensitivity Digital Ladder Fi}ten with Elliptic Magnitude Response", IEF~ Traits. on Circuits and Systems, pp. 697-706, luly 1986.
• 17: Jain R., MJ. Mlinar, A.C. Parker, "Area-Time Model for Synthesis of Non-Pipelined D~igns', ICCAD-88, Nove. 1988, pp. 48-51.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.6 Optimization
          Subjects: Linear programming

Additional Classification:
  B. Hardware
  B.5 REGISTER-TRANSFER-LEVEL IMPLEMENTATION

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

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Trees

General Terms:
Algorithms, Design, Experimentation