Sequential performance of asynchronous conservative PDES algorithms

Proceedings - Workshop on Principles of Advanced and Distributed Simulation, PADS

Volumn , Issue , 2005, Pages 217-226

  Curry, Roger ^a   Kiddle, Cameron ^a   Simmonds, Rob ^a   Unger, Brian ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Conservative Synchronization; Parallel Discrete Event Simulation; Sequential Discrete Event Simulation

Indexed keywords

CONSERVATIVE SYNCHRONIZATION; PARALLEL DISCRETE EVENT SIMULATIONS; SEQUENTIAL DISCRETE EVENT SIMULATION;

COMPUTER SIMULATION; QUEUEING NETWORKS; SIMULATORS;

ALGORITHMS;

EID: 26844444182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PADS.2005.25     Document Type: Conference Paper

References (17)

1. T. D. Blanchard, T. W. Lake, and S. J. Turner. Cooperative acceleration: Robust conservative distributed discrete event simulation. In Proceedings of the 8th Workshop on Parallel and Distributed Simulation, pages 58-64, 1994.
2. R. Brown. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM, 31(10):1220-1227, 1988.
3. R. E. Bryant. Simulation of packet communication architecture computer systems. Technical Report TR-188, MIT Labratory for Computer Science, 1977.
4. W. Cai and S. J. Turner. An algorithm for distributed discreteevent simulation - the "carrier null message" approach. In Proceedings of the SCS Multiconference on Distributed Simulation, volume 22 of SCS Simulation Series, pages 3-8, 1990.
5. K. M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5(5):440-452, 1979.
6. D. R. Jefferson. Virtual time. ACM Transactions on Programming Languages and Systems, 7(3):404-425, 1985.
7. D. W. Jones. An empirical comparison of priority-queue and event-set implementations. Communications of the ACM, 29(4):300-311, 1986.
8. C. Kiddle. Scalable Network Emulation. PhD thesis, Computer Science Department, University of Calgary, 2004.
9. J. Liu, D. M. Nicol, and K. Tan. Lock-free scheduling of logical processes in parallel simulation. In Proceedings of the 15th Workshop on Parallel and Distributed Simulation, pages 22-31, 2001.
10. W. M. McCormack and R. G. Sargent. Analysis of future event set algorithms for discrete event simulation. Communications of the ACM, 24(12):801-812, 1981.
11. D. Nicol and J. Liu. Composite synchronization in parallel discrete-event simulation. IEEE Transactions on Parallel and Distributed Systems, 13(5):443-446, 2002.
12. R. Simmonds, C. Kiddle, and B. Unger. Addressing blocking and scalability in critical channel traversing. In Proceedings of the 16th Workshop on Parallel and Distributed Simulation, pages 17-24, 2002.
13. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, 1985.
14. Valgrind. Available from http://valgrind.kde.org/.
15. J. G. Vaucher and P. Duval. A comparison of simulation event list algorithms. Communications of the ACM, 18(4):223-230, 1975.
16. Z. Xiao, R. Simmonds, B. Unger, and J. Cleary. Fast cell level ATM network simulation. In Proceedings of the 2002 Winter Simulation Conference, pages 712-719, 2002.
17. Z. Xiao, B. Unger, R. Simmonds, and J. Cleary. Scheduling critical channels in conservative parallel discrete event simulation. In Proceedings of the 13th Workshop on Parallel and Distributed Simulation, pages 20-28, 1999.