Experimental Evaluation of Dynamic Scheduling for Parallel Logic Simulation Using Benchmark Circuits (Special Section of Letters Selected from the 1994 IEICE Spring Conference)

概要

論文の詳細を見る
We discuss a processor scheduling problem for parallel logic simulation of combinational circuits. In the processor scheduling problem, to be discussed in this paper, for logic simulation using time-first method, the time needed for each gate evaluation is not given beforehand, and is not constant. This feature distinguishes the processor scheduling problem from typical task scheduling problems. First, we devise newly Algorithm MET to solve the processor scheduling problem. The key idea of Algorithm MET is to determine processor scheduling incrementally and dynamically. Then, experimental evaluations using well-known twelve benchmark combinational circuits show the usefulness of Algorithm MET, compared with conventional static algorithms. We believe that this is a first step to implement parallel logic simulation of combinational circuits.
社団法人電子情報通信学会の論文
1994-11-25