Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An analytical comparison of periodic checkpointing and incremental state saving
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Understanding supercritical speedup
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Scheduling time warp processes using adaptive control techniques
WSC '94 Proceedings of the 26th conference on Winter simulation
Service oriented scheduling in Time Warp
WSC '94 Proceedings of the 26th conference on Winter simulation
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
A performance evaluation methodology for parallel simulation protocols
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Adaptive flow control in time warp
Proceedings of the eleventh workshop on Parallel and distributed simulation
A probabilistic event scheduling policy for optimistic parallel discrete event simulation
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Scheduling critical channels in conservative parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
A New Scheduling Method for Parallel Discrete-Event Simulation
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Improving Lookahead in Parallel Wireless Network Simulation
MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Estimating rollback overhead for optimism control in Time Warp
SS '95 Proceedings of the 28th Annual Simulation Symposium
Lock-free scheduling of logical processes in parallel simulation
Proceedings of the fifteenth workshop on Parallel and distributed simulation
A probabilistic performance model for conservative simulation protocol
Proceedings of the fifteenth workshop on Parallel and distributed simulation
An Analytical Model of Scheduling for Conservative Parallel Simulation
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Conservative synchronization of large-scale network simulations
Proceedings of the eighteenth workshop on Parallel and distributed simulation
A null message count of a conservative parallel simulation
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
| Hi-index | 0.00 |
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.