Parallel simulation of queueing networks: limitations and potentials
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Control and coordination policies for systems with buffers
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Unboundedly parallel simulations via recurrence relations
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
Experience in massively parallel discrete event simulation
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A sweep algorithm for massively parallel simulation of circuit-switched networks
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
The Complexity of Parallel Evaluation of Linear Recurrences
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Unboundedly parallel simulations via recurrence relations for network and reliability problems
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Parallel trace-driven cache simulation by time partitioning
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Massively Parallel Algorithms for Trace-Driven Cache Simulations
IEEE Transactions on Parallel and Distributed Systems
Time-Parallel Trace-Driven Simulation of CSMA/CD
Proceedings of the seventeenth workshop on Parallel and distributed simulation
The decomposition of a blocking model for connection-oriented networks
IEEE/ACM Transactions on Networking (TON)
Instruction-level simulation of a cluster at scale
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
| Hi-index | 0.00 |
Nonconventional parallel simulations methods are presented, wherein speed-ups are not limited by the number of simulated components. The methods capitalize on Chandy and Sherman's space-time relaxation paradigm, and incorporate fast algorithms for solving recurrences. Special attention is paid to implementing these algorithms on currently available massively parallel SIMD computers. As examples, “superfast” simulations for open and closed queuing networks and for the slotted ALOHA communication protocol are discussed. Several of the simulations are implemented and show impressive computational speeds. This paper summarizes previous results of the authors and presents some new experiments and simulations.