Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Scheduling critical channels in conservative parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
An empirical study of conservative scheduling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
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
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
A null message count of a conservative parallel simulation
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
The critical path provides a lower bound on the execution time of a distributed discrete event simulation. The optimal execution time can be achieved by immediately executing each event on the critical path. A solution is to preferentially schedule an LP, called a critical parent, which probably has a critical event. Critical parent preferential scheduling has been experienced as a viable solution of conservative LP scheduling. In this paper, we introduce a mathematical analysis to showt he quantitative benefit of critical parent preferential scheduling in terms of speed-up of execution time. The analysis shows the benefit of the critical parent preferential scheduling with the acceleration of earliest incoming time update and with the reduction of non-critical null messages. The effectiveness of analytical model has been validated with experiments.