An execution model for distributed object-oriented computation

Authors:
Edward H. Bensley;Thomas J. Brando;Myra Jean Prelle
Affiliations:
The MITRE Corporation, Bedford, MA;The MITRE Corporation, Bedford, MA;The MITRE Corporation, Bedford, MA
Venue:
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Year:
1988

Citing 8
Cited 6

System design with Ada

System design with Ada
Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
MULTILISP: a language for concurrent symbolic computation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation

ACM Computing Surveys (CSUR)
Parallel programming

Parallel programming
Time warp operating system

SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Programming parallel processors

Programming parallel processors
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing

MITRE's future generation computer architectures program

OOPSLA/ECOOP '88 Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming
FUTURES: a mechanism for concurrency among objects

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
The impact of selected concurrent language constructs on the Sam run-time system

OOPSLA/ECOOP '90 Proceedings of the workshop on Object-based concurrent programming
Mathematical foundations for time warp systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
A path-based method of parallelizing C++ programs

ACM SIGPLAN Notices
Recovering from Multiple Process Failures in the Time Warp Mechanism

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an execution model being developed for distributed object-oriented in a message-passing multiple-instruction/multiple-data-stream (MIMD) environment. The objective is to execute an object-oriented program as concurrently as possible. Some opportunities for concurrency can be identified explicitly by the programmer. Others can be identified at compile time. There are some opportunities for concurrency, however, that can only be discovered at runtime because they are data-dependent. The model of execution we describe attempts to discover and exploit the data-dependent concurrency that exists in a given program execution.