The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Virtual time
Open accessAbstract
Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control. Virtual time provides a flexible abstraction of real time in much the same way that virtual memory provides an abstraction of real memory. It is implemented using the Time Warp mechanism, a synchronization protocol distinguished by its reliance on lookahead-rollback, and by its implementation of rollback via antimessages.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Distributed snapshots: determining global states of distributed systems
Chandy, K. M., & Lamport, L. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214451.214456 · Cited by 2,443
Ethernet: distributed packet switching for local computer networks
Metcalfe, R. M., & Boggs, D. R. (1983) · Communications of the ACM · doi:10.1145/357980.358015 · Cited by 1,509
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186
Implementing atomic actions on decentralized data
Reed, D. P. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357355 · Cited by 307
State Restoration in Systems of Communicating Processes
Russell, D. L. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230469 · Cited by 154
Synchronization in Distributed Programs
Schneider, F. B. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357163 · Cited by 142
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
An approach to performance analysis of timestamp-driven synchronization mechanisms
Jefferson, D. R., & Witkowski, A. (1984) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800222.806751 · Cited by 13
Self-citation
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
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
Distributed discrete-event simulation
Misra, J. (1986) · ACM Computing Surveys · doi:10.1145/6462.6485 · Cited by 998
Tanenbaum, A. S., & Van Renesse, R. (1985) · ACM Computing Surveys · doi:10.1145/6041.6074 · Cited by 990
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
The Chubby lock service for loosely-coupled distributed systems
Burrows, M. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298487 · Cited by 877
The Past, Present and Future of Cyber-Physical Systems: A Focus on Models
Lee, E. (2015) · Sensors · doi:10.3390/s150304837 · Cited by 682
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
MillWheel: fault-tolerant stream processing at internet scale
Akidau, T., Balikov, A., Bekiroğlu, K., Chernyak, S., Haberman, J., Lax, R., McVeety, S., Mills, D., Nordstrom, P., & Whittle, S. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536222.2536229 · Cited by 536
Graphite: A distributed parallel simulator for multicores
Miller, J. E., Kasture, H., Kurian, G., Gruenwald, C., Beckmann, N., Celio, C., Eastep, J., & Agarwal, A. (2010) · HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.2010.5416635 · Cited by 478
Optimistic parallelism requires abstractions
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250759 · Cited by 441
Real time groupware as a distributed system: concurrency control and its effect on the interface
Greenberg, S., & Marwood, D. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.193011 · Cited by 390
Gomes, C., Thule, C., Broman, D., Larsen, P. G., & Vangheluwe, H. (2019) · ACM Computing Surveys · doi:10.1145/3179993 · Cited by 369
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 case for reflective middleware
Kon, F., Costa, F., Blair, G., & Campbell, R. H. (2002) · Communications of the ACM · doi:10.1145/508448.508470 · Cited by 339
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
Speculative execution in a distributed file system
Nightingale, E. B., Chen, P. M., & Flinn, J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095829 · Cited by 94
Metadata
- Authors
- Jefferson, D. R.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1985-07
- Volume
- 7
- Issue
- 3
- Pages
- 404-425
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2296636214
- Cited by
- 2,397
- References
- 9
- FWCI
- 40.60
- 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.