Graham D. Parrington

An overview of the Arjuna distributed programming system

The use of the objects and actions computational model to develop Arjuna is discussed, and its system architecture is described. An overview of Arjunas implementation is given. An example is provided to show how to construct Arjuna applications.<<ETX>>

Implementing concurrency control in reliable distributed object-oriented systems

One of the key concepts available in many object-oriented programming languages is that of type-inheritance, which permits new types to be derived from, and inherit the capabilities of, old types. This paper describes how to exploit this property in a very simple fashion to implement object-oriented concurrency control. We show how by using type-inheritance, objects may control their own level of concurrency in a type-specific manner. Simple examples demonstrate the applicability of the approach. The implementation technique described here is being used to develop Arjuna, a fault-tolerant distributed programming system supporting atomic actions.

Shadows-a flexible support system for objects in distributed systems

Shadows is a simple, but flexible, architecture based upon only three hey facilities: object servers, object migration and location-transparent operation invocation. We show how several powerful object properties such as object caching, object shareability, and persistence can easily be created by exploiting only these three concepts. The Shadows architecture requires only capabilities found in common object-oriented languages and modern operating systems. An instance of the Shadows architecture has been implemented in C++ on a distributed memory multiprocessor system.<<ETX>>

Objects and actions in reliable distributed systems

This paper describes a method for constructing robust distributed programs. The method is based upon the provision of atomic actions that operate upon objects (instances of abstract data types). The paper begins by constructing robustnon-distributed programs using the atomicaction mechanism and then proceeds to showhow robust distributed programs can be constructed in a similar fashion. Finally, the paper briefly examines other prototy pedistributed systems and examines their approachto the reliability problem.