A New Partitioning Scheme of Parallel VHDL Simulation
Authors:
- 1 June 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Abstract
The static partitioning algorithm and assigning were generally researched respectively, which has largely resulted in the deficiency in the workload balance of the static partitioning. A new partitioning scheme of parallel VHDL simulation is presented in the paper. Partitioning and assigning both are processed just before the simulation in the scheme, and are included in the running phase. Because of this, it strictly requests that the time complexity of partitioning algorithm is minimum. A new static partitioning algorithm, fan-out right partitioning algorithm, which has a lower time complexity and good performance, is presented in the paper. The experiment result shows that the performance of parallel VHDL simulation is improved with this scheme and partitioning algorithmKeywords
This publication has 6 references indexed in Scilit:
- Model partitioning and the performance of distributed timewarp simulation of logic circuitsSimulation Practice and Theory, 1997
- Concurrency preserving partitioning (CPP) for parallel logic simulationACM SIGSIM Simulation Digest, 1996
- Parallel Logic Simulation of VLSI Systems1995
- Corolla partitioning for distributed logic simulation of VLSI-circuits1993
- Efficient circuit partitioning algorithms for parallel logic simulation1989
- Concurrency and Communication in Hardware SimulatorsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986