Object oriented design for a distributed priority queue

An abstract model for distributed objects is presented which is useful for designing and implementing software for distributed systems. In this model, constituent objects share a distributed state, and are identical representatives of the distributed object. To its users, a distributed object has the same semantics and behavior as an ordinary object, even though it is actually a set of constituent objects which are distributed among the sites of a distributed system. A versatile scheme for implementing a distributed priority queue based upon our abstract model of distributed objects is also presented. Distributed objects are used in the implementation of the distributed priority queue because they provide a nice abstraction for managing and controlling access to data which is distributed among the sites of a distributed computing system. Load balancing issues for a discrete model of the distributed priority queue are also examined to determine the efficiency of the distributed priority queue algorithms