Proceedings Fourteenth Workshop on Parallel and Distributed Simulation (2000)
May 28, 2000 to May 31, 2000
Ha Yoon Song , University of California at Los Angeles
Richard A. Meyer , University of California at Los Angeles
Rajive Bagrodia , University of California at Los Angeles
It is well known that the critical path provides an absolute lower bound on the execution time of a conservative parallel discrete event simulation. It stands to reason that optimal execution time can only be achieved by immediately executing each event on the critical path. However, dynamically identifying the critical event is difficult, if not impossible. In this paper, we examine several heuristics that might help to determine the critical event, and conduct a performance study to determine the effectiveness of using these heuristics for preferential scheduling.
conservative parallel discrete event simulation, scheduling, lookahead, critical path
H. Y. Song, R. Bagrodia and R. A. Meyer, "An Empirical Study of Conservative Scheduling," Proceedings Fourteenth Workshop on Parallel and Distributed Simulation(PADS), Bologna, Italy, 2000, pp. 165.