The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2000)
Bologna, Italy
May 28, 2000 to May 31, 2000
ISSN: 1087-4097
ISBN: 0-7695-0677-1
pp: 165
Ha Yoon Song , University of California at Los Angeles
Rajive Bagrodia , University of California at Los Angeles
Richard A. Meyer , University of California at Los Angeles
ABSTRACT
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.
INDEX TERMS
conservative parallel discrete event simulation, scheduling, lookahead, critical path
CITATION
Ha Yoon Song, Rajive Bagrodia, Richard A. Meyer, "An Empirical Study of Conservative Scheduling", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 165, 2000, doi:10.1109/PADS.2000.847162
85 ms
(Ver 3.3 (11022016))