The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Distributed discrete-event simulation
Open accessAbstract
Traditional discrete-event simulations employ an inherently sequential algorithm. In practice, simulations of large systems are limited by this sequentiality, because only a modest number of events can be simulated. Distributed discrete-event simulation (carried out on a network of processors with asynchronous message-communicating capabilities) is proposed as an alternative; it may provide better performance by partitioning the simulation among the component processors. The basic distributed simulation scheme, which uses time encoding, is described. Its major shortcoming is a possibility of deadlock. Several techniques for deadlock avoidance and deadlock detection are suggested. The focus of this work is on the theory of distributed discrete-event simulation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Jefferson, D. R. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3916.3988 · Cited by 2,397
Principles of Discrete Event Simulation.
Johnson, M. E., & Fishman, G. S. (1980) · Journal of the American Statistical Association · doi:10.2307/2287424 · Cited by 538
Proceedings of the 2002 Winter Simulation Conference
(2002) · Proceedings of the Winter Simulation Conference · doi:10.1109/wsc.2002.1166355 · Cited by 456
Distributed deadlock detection
Chandy, K. M., Misra, J., & Haas, L. M. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357360.357365 · Cited by 394
Self-citationBirtwhistle, G. M., Dahl, O., Myhrhaug, B., et al. (1979) · Cited by 335
Proceedings of the 46th International Symposium on Computer Architecture
(2019) · doi:10.1145/3307650 · Cited by 320
Distributed simulation using a network of processors
Peacock, J. K., Wong, J. W., & Manning, E. G. (1979) · Computer Networks (1976) · doi:10.1016/0376-5075(79)90053-9 · Cited by 141
Winter simulation conference 1980
Pratt, C. A., & MARR, G. A. (1981) · SIMULATION · doi:10.1177/003754978103600105 · Cited by 72
A shared resource algorithm for distributed simulation
Reynolds, P. F. (1982) · ACM SIGARCH Computer Architecture News · doi:10.1145/1067649.801734 · Cited by 63
Cited by
A survey of rollback-recovery protocols in message-passing systems
Elnozahy, E. N. (., Alvisi, L., Wang, Y.-M., & Johnson, D. B. (2002) · ACM Computing Surveys · doi:10.1145/568522.568525 · Cited by 1,804
GloMoSim: a library for parallel simulation of large-scale wireless networks
Zeng, X., Bagrodia, R. L., & Gerla, M. (1998) · doi:10.1145/278008.278027 · Cited by 1,318
Parallel and distributed simulation systems
Fujimoto, R. M. (2002) · Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304) · doi:10.1109/wsc.2001.977259 · Cited by 1,264
The Past, Present and Future of Cyber-Physical Systems: A Focus on Models
Lee, E. (2015) · Sensors · doi:10.3390/s150304837 · Cited by 682
GloMoSim: a library for parallel simulation of large-scale wireless networks
Zeng, X., Bagrodia, R., & Gerla, M. (1998) · ACM SIGSIM Simulation Digest · doi:10.1145/278009.278027 · Cited by 475
GloMoSim: a library for parallel simulation of large-scale wireless networks
Zeng, X., Bagrodia, R., & Gerla, M. (2002) · Proceedings. Twelfth Workshop on Parallel and Distributed Simulation PADS '98 (Cat. No.98TB100233) · doi:10.1109/pads.1998.685281 · Cited by 460
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
The Wisconsin Wind Tunnel: virtual prototyping of parallel computers
Reinhardt, S. K., Hill, M. D., Larus, J. R., Lebeck, A. R., Lewis, J. C., & Wood, D. A. (1993) · Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems · doi:10.1145/166955.166979 · Cited by 353
Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation
Mattern, F. (1993) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1993.1075 · Cited by 352
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993501 · Cited by 312
Steady-state simulation of queueing processes: survey of problems and solutions
Pawlikowski, K. (1990) · ACM Computing Surveys · doi:10.1145/78919.78921 · Cited by 256
Challenging implicit and explicit alcohol-related cognitions in young heavy drinkers
Wiers, R. W., Van De Luitgaarden, J., Van Den Wildenberg, E., & Smulders, F. T. Y. (2005) · Addiction · doi:10.1111/j.1360-0443.2005.01064.x · Cited by 238
Metadata
- Authors
- Misra, J.
- Venue
- ACM Computing Surveys
- Published
- 1986-03
- Volume
- 18
- Issue
- 1
- Pages
- 39-65
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2118900647
- Cited by
- 998
- References
- 9
- FWCI
- 38.91
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.