Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

The virtual machine

Published: 01 March 1991 Publication History

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 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.

References

[1]
[1] J. Cleary, B. Unger, and X. Li. A Distributed And-Parallel Backtracking Algorithm Using Virtual Time. Proceedings of the SCS Multiconference on Distributed Simulation, 19(3):177-182, July 1988.
[2]
[2] R. M. Fujimoto. Performance Measurements of Distributed Simulation Strategies. Technical Report UU-CS-TR-87-026a, Dept. of Computer Science, University of Utah, Salt Lake City, November 1987.
[3]
[3] R. M. Fujimoto. Time Warp on a Shared Memory Multiprocessor. Proceedings of the 1989 International Conference on Parallel Processing, August 1989.
[4]
[4] R. M. Fujimoto, J. Tsai, and G. Gopalakrishnan. Design and Evaluation of the Rollback Chip: Special Purpose Hardware for Time Warp. Technical Report UUCS-88-011, Dept of Computer Science, Univ. of Utah, July 1988.
[5]
[5] A. Gafni. Rollback Mechanisms for Optimistic Distributed Simulation Systems. Proceedings of the SCS Muiticonference on Distributed Simulation, 19(3):61- 67, July 1988.
[6]
[6] W.-M. Hwu and Y. N. Patt. Checkpoint Repair for High-Performance Out-of-Order Execution Machines. IEEE Transactions on Computer, C-36(12):1496-1514, December 1987.
[7]
[7] D. R. Jefferson. private communication. November 1988.
[8]
[8] D. R. Jefferson. Virtual Time. ACM Transactions on Programming Languages and Systems, 7(3):404-425, July 1985.
[9]
[9] D. W. Jones. An Empirical Comparison of Priority-Queue and Event-Set Implementations. Communication of the ACM, 29(4):300-311, April 1986.
[10]
[10] T. Knight. An Architecture for Mostly Functional Programs. In Proc. Lisp and Functional Programming Conference, ACM, Cambridge, Mass., August 1986.
[11]
[11] D. Kuck. The Structure of Computers and Computation . Volume 1, John Wiley & Sons, New York, 1978.
[12]
[12] H. T. Kung and J. T. Robinson. On Optimistic Methods of Concurrency Control. ACM Transaction on Database Systems, 6(2), June 1981.
[13]
[13] T. J. Leblanc and J. M. Mellor-Crummey. Debugging Parallel Programs with Instant Replay. IEEE Transactions on Computers, C-36(4), April 1987.
[14]
[14] J. Lee and A. J. Smith. Branch Prediction Strategies and Branch Target Buffer Design. IEEE Computer, 17(1), January 1984.
[15]
[15] K. Li. IVY: A Shared Virtual Memory System for Parallel Computing. Proceedings of the 1988 International Conference on Parallel Processing, Vol. 2, 94-101, August 1988.
[16]
[16] G. F. Pfister. The Yorktown Simulation Engine: Introduction. In Proc. 19th Design Automation Conference, pages 51-54, June 1982.
[17]
[17] D. D. Sleator and R. E. Tarjan. Self-Adjusting Binary Search Trees. Journal of the ACM, 32(3):652-686, July 1985.
[18]
[18] P. Tinker. Task Scheduling for General Rollback Computing. In Proceedings of the 1989 International Conference on Parallel Processing, August 1989.
[19]
[19] P. Tinker and M. Katz. Parallel Execution of Sequential Scheme with Para Tran. In Proc. Lisp and Functional Programming Conference, ACM, Snowbird, Utah, July 1988.

Cited By

View all
  • (1995)Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) PADS-9510.1109/PADS.1995.404323(0_1)Online publication date: 1995
  • (1995)The treatment of state in optimistic systemsProceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)10.1109/PADS.1995.404318(40-49)Online publication date: 1995

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News
ACM SIGARCH Computer Architecture News  Volume 19, Issue 1
Symposium on parallel algorithms and architectures
March 1991
155 pages
ISSN:0163-5964
DOI:10.1145/121956
  • Editor:
  • Doug DeGroot
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1991
Published in SIGARCH Volume 19, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)1
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (1995)Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) PADS-9510.1109/PADS.1995.404323(0_1)Online publication date: 1995
  • (1995)The treatment of state in optimistic systemsProceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)10.1109/PADS.1995.404318(40-49)Online publication date: 1995

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media