Multiple-level partitioning: an application to the very large-scale hardware simulator

With modern technology, a very-large-scale system may contain several million gates. To achieve an optimal multiple-level partitioning of such a system onto a fixed hierarchy hardware accelerator presents a formidable challenge to even the fastest computing engines currently available. The application of a divide-and-conquer heuristic coupled with a novel ratio-cut algorithm that solves the above problem under a variety, of constraints is described. The goal of this approach is to minimize the communication cost in the hierarchy. Experiments with designs containing up to two million gates are described, and it is demonstrated that the proposed approach decreased communication costs by a factor of two or more when compared with other approaches. This approach enables the hardware simulator to perform approximately three billion gate evaluations per second. or approximately 200 million event evaluations in an event-driven simulator, using a 6% activity rate. >

[1]  Chung-Kuan Cheng.  The optimal circuit decompositions using network flow formulations , 1990, IEEE International Symposium on Circuits and Systems.

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Brian W. Kernighan,et al.  A proper model for the partitioning of electrical circuits , 1972, DAC '72.

[4]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[5]  Tom Blank,et al.  A Survey of Hardware Accelerators Used in Computer-Aided Design , 1984, IEEE Design & Test of Computers.

[6]  A. J. Stone,et al.  Logic partitioning , 1966, DAC.

[7]  Gregory Francis Pfister,et al.  The Yorktown Simulation Engine: Introduction , 1982, DAC 1982.

[8]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[9]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[11]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  M.M. Denneau.  The Yorktown Simulation Engine , 1982, 19th Design Automation Conference.

[13]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[14]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[15]  Larry N. Dunn.  IBM'S Engineering Design System Support for VLSI Design and Verification , 1984, IEEE Design & Test of Computers.

[16]  Carl Sechen,et al.  An improved objective function for mincut circuit partitioning , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.