Proceedings of Symposium on Parallel and Distributed Tools (1996)
May 22, 1996 to May 24, 1996
Hong K. Kim , Wright State University
Jack Jean , Wright State University
Based on a linear ordering of vertices in a directed graph, a linear-time partitioning algorithm for parallel logic simulation is presented. Unlike most other partitioning algorithms, the proposed algorithm preserves circuit concurrency by assigning to processors circuit gates that can be evaluated at about the same time. As a result, the concurrency preserving partitioning (CPP) algorithm can provide better load balancing throughout the period of a parallel simulation. This is especially important when the algorithm is used together with a Time Warp simulation where a high degree of concurrency can lead to fewer rollbacks and better performance. The algorithm consists of three phases, and three conflicting goals can be separately considered in each phase so to reduce computational complexity. A parallel gate-level circuit simulator is implemented on an Intel Paragon machine to evaluate the performance of the CPP algorithm. The results are compared with two other partitioning algorithms to show that reasonable speedup may be achieved with the algorithm.
Parallel Logic Simulation, Partitioning, Concurrency, Load Balancing, Time Warp
J. Jean and H. K. Kim, "Concurrency Preserving Partitioning (CPP) for Parallel Logic Simulation," Proceedings of Symposium on Parallel and Distributed Tools(PADS), Philadelphia, PA, 1996, pp. 0098.