Algorithms for unboundedly parallel simulations
- 1 August 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 9 (3) , 201-221
- https://doi.org/10.1145/128738.128739
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Acyclic fork-join queuing networksJournal of the ACM, 1989
- Control and coordination policies for systems with buffersACM SIGMETRICS Performance Evaluation Review, 1989
- Parallel simulation of queueing networks: limitations and potentialsACM SIGMETRICS Performance Evaluation Review, 1989
- Efficient distributed event-driven simulations of multiple-loop networksCommunications of the ACM, 1989
- Using the multistage cube network topology in parallel supercomputersProceedings of the IEEE, 1989
- Distributed discrete-event simulationACM Computing Surveys, 1986
- Virtual timeACM Transactions on Programming Languages and Systems, 1985
- Development of the ALOHANETIEEE Transactions on Information Theory, 1985
- Parallel Prefix ComputationJournal of the ACM, 1980
- The Complexity of Parallel Evaluation of Linear RecurrencesJournal of the ACM, 1977