ACM Transactions on Programming Languages and Systems (TOPLAS)
A high fidelity ATM traffic and network simulator
WSC '95 Proceedings of the 27th conference on Winter simulation
Principles of conservative parallel simulation
WSC '96 Proceedings of the 28th conference on Winter simulation
Performance of a conservative simulator of ATM networks
Proceedings of the eleventh workshop on Parallel and distributed simulation
Multithreaded programming with Pthreads
Multithreaded programming with Pthreads
Scheduling critical channels in conservative parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Lock-free scheduling of logical processes in parallel simulation
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Controlling Buffer Usage in Critical Channel Traversing
SS '02 Proceedings of the 35th Annual Simulation Symposium
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
A case study of web server benchmarking using parallel WAN emulation
Performance Evaluation
Performance of a mixed shared/distributed memory parallel network simulator
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Simulation of large scale networks I: modelling differentiated services in conservative PDES
Proceedings of the 35th conference on Winter simulation: driving innovation
Improving Scalability of Network Emulation through Parallelism and Abstraction
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
Optimization aspects in network simulation
Proceedings of the 5th international conference on Aspect-oriented software development
Parallel and distributed simulation: traditional techniques and recent advances
Proceedings of the 38th conference on Winter simulation
| Hi-index | 0.00 |
This paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when used in a wide area computer network simulator. The first of the new algorithms called simple sender side CCT is similar to the original, but busy waiting is eliminated. Results presented show that simple sender side CCT avoids performance problems that can be caused by busy waiting.The second new algorithm called receive side CCT employs a different strategy for updating channel clocks and determining which objects should be scheduled on critical channels. Performance results show that this version provides better scaling with respect to the connectivity of the model, at the expense of some added complexity.