The virtual time machine
- 1 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 199-208
- https://doi.org/10.1145/72935.72957
Abstract
A parallel computer architecture is proposed that is based on an optimistic style of execution. Specifically, the Virtual Time Machine (VTM) detects violations of data depen- dence constraints at runtime, and automatically recovers from them. In order to efficiently implement this mecha- nism, a sophisticated, two-dimensional memory system is proposed that is addressed using both a spatial and a tern. poral coordinate. Initially targeted for discrete event sim- ulation applications, the long term goal of this work is to develop a generaJ purpose parallel computer that will sup- port a wide range of parallel programming paradigms. This paper outlines the motivations behind the VTM ar- chitecture, the underlying computation model, a proposed implementation, and initial performance results. A recur- ring theme that pervades the entire paper is our contention that existing shared memory and message-base machines do not pay adequate attention to the dimension of time.Keywords
This publication has 8 references indexed in Scilit:
- Parallel execution of sequential scheme with ParaTranPublished by Association for Computing Machinery (ACM) ,1988
- Checkpoint Repair for High-Performance Out-of-Order Execution MachinesIEEE Transactions on Computers, 1987
- Debugging Parallel Programs with Instant ReplayIEEE Transactions on Computers, 1987
- An empirical comparison of priority-queue and event-set implementationsCommunications of the ACM, 1986
- An architecture for mostly functional languagesPublished by Association for Computing Machinery (ACM) ,1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Virtual timeACM Transactions on Programming Languages and Systems, 1985
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981