A New Partitioning Scheme of Parallel VHDL Simulation

Authors:

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 algorithm