Study of a Multilevel Approach to Partitioning for Parallel Logic Simulation

Parallel simulation techniques are often employed to meet the computational requirements of large hardware simulations in order to reduce simulation time. In addition, partitioning for parallel simulations has been shown to be vital for achieving higher simulation throughput. This paper presents the results of our partitioning studies conducted on an optimistic parallel logic simulation framework based on the Time Warp synchronization protocol. The paper also presents the design and implementation of a new partitioning algorithm based on a multilevel heuristic, developed as a part of this study. The multilevel algorithm attempts to balance load, maximize concurrency, and reduce inter-processor communication in three phases to improve performance. The experimental results obtained from our benchmarks indicate that the multilevel algorithm yields better partitions than other partitioning algorithms included in the study.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Swaminathan Subramanian, Dhananjai Madhava Rao, Philip A. Wilsey
• Keywords: Distributed And Parallel Computing, IPPS 2000, Parallel Simulations, Partitioning Algorithms, Simulation