Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Debugging Parallel Programs with Instant Replay
IEEE Transactions on Computers
Checkpoint repair for high-performance out-of-order execution machines
IEEE Transactions on Computers
Parallel execution of sequential scheme with ParaTran
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
An architecture for mostly functional languages
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Structure of Computers and Computations
Structure of Computers and Computations
The Yorktown Simulation Engine: Introduction
DAC '82 Proceedings of the 19th Design Automation Conference
| Hi-index | 0.00 |
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 dependence constraints at runtime, and automatically recovers from them. In order to efficiently implement this mechanism, a sophisticated, two-dimensional memory system is proposed that is addressed using both a spatial and a temporal coordinate. Initially targeted for discrete event simulation applications, the long term goal of this work is to develop a general purpose parallel computer that will support a wide range of parallel programming paradigms.This paper outlines the motivations behind the VTM architecture, the underlying computation model, a proposed implementation, and initial performance results. A recurring 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.