DocumentCode :
506163
Title :
Efficient circuit partitioning algorithms for parallel logic simulation
Author :
Patil, Srinivas ; Banerjee, Prithviraj ; Polychronopoulos, Constantine D.
Author_Institution :
Center for Reliable and High Performance Computing, Coordinated Science Laboratory, University of Illinois, Urbana, IL
fYear :
1989
fDate :
12-17 Nov. 1989
Firstpage :
361
Lastpage :
370
Abstract :
General purpose parallel processing machines are increasingly being used to speed up a variety of VLSI CAD applications. This paper addresses logic simulation on parallel machines by exploiting the concurrency in the circuit being simulated (called data parallelism) as opposed to exploiting parallelism inherent in the simulation algorithm itself (called functional parallelism). The most crucial step in obtaining the maximum parallelism using data parallelism is the partitioning of circuit elements. We introduce a cost function which tries to model the simulation of a logic circuit in a parallel environment. The cost function tries to estimate the parallel run time for logic simulation given the processor assignment and the underlying multiprocessor architecture. We then present different heuristic algorithms to partition the circuit and evaluate the efficiency of these algorithms using the proposed cost function. Partitioning algorithms for both event-driven and compiled code simulation are given.
Keywords :
Circuit simulation; Concurrent computing; Cost function; Discrete event simulation; Heuristic algorithms; Logic circuits; Parallel machines; Parallel processing; Partitioning algorithms; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Supercomputing, 1989. Supercomputing '89. Proceedings of the 1989 ACM/IEEE Conference on
Conference_Location :
Reno, NV, United States
Print_ISBN :
0-89791-341-8
Type :
conf
DOI :
10.1145/76263.76303
Filename :
5348998
Link To Document :
بازگشت