John Daniels and Steve Cook. Strategies for sharing objects in distributed systems. Journal of Object-Oriented Programming, January 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to think of the structures in both stores as the same except at points where the differences matter. However, this incurs costs and we allow the application programmer to choose when to pay them. The traditional solution for sharing objects based on remote references to the object being shared [DC93] is highly dependent on the availability of the store in which the object resides, and thus precludes autonomous stores, availability and scalability [MdSAB96] Either cache coherency of copies is maintained requiring update propagation [KSD 90] or remote references denote objects requiring ....

John Daniels and Steve Cook. Strategies for sharing objects in distributed systems. Journal of Object-Oriented Programming, January 1993.

....with our scheme of migration by substitution [20, 19, 18] 2. Sharing objects between stores There are basically two approaches to solve the sharing problem in a distributed system: one copy (by remote access, see previous paragraph) or many copies (using some sort of replication protocol) [8]. The problem with replication is to maintain the replicas consistent when they are updated. Strict replication protocols that maintain the replicas always consistent can be used, but they require remote references and thus suffer from similar problems as the one copy approach. In order to deal ....

J. Daniels and S. Cook. Strategies for sharing objects in distributed systems. Journal of ObjectOriented Programming, January 1993.

....dispose an object when no longer needed, e.g. objects derived from the standard class object, by sending the message close 0 to it. In this sense objects in AKL greatly simulate real life objects. 4.2. 3 Sharing Objects With object sharing, multiple applications or objects share a common object [40]. Object sharing is realized in AKL by passing an object as a parameter to classes at creation time of their instances. For example, consider the class buffer sync, see Example 4.7, that defines a buffer object with two operations put 1 to store an item and get 1 to remove an item, see Fig. 4.9. ....

Daniels J., Cook S. Strategies for Sharing Objects in Distributed Systems, Journal of Object-Oriented Programming, 5(8):27--36, Jan., 1993.

....B. In the above regime it is difficult to predict the original state of C, particularly as remote copies of C may in the interim have been updated by programs in the target store. The traditional solution for sharing objects between stores is based on remote references to the object being shared [DC93] for example, by remote references requiring all operations to refer to the original store [Wai88] or cache coherency of copies requiring update propagation [KSD 90] However, remote references force sharing to be highly dependent on the availability of the store in which the object resides, ....

J. Daniels and S. Cook. Strategies for sharing objects in distributed systems. Journal of Object-Oriented Programming, January 1993.

....more general problem: how to share objects between other objects that reside in different programs. There are basically two approaches to solve the sharing problem in a distributed system: one copy (by remote access, see previous paragraph) or many copies (using some sort of replication protocol) [23]. Below we describe each of these approaches in turn. Figure 4 illustrates the one copy approach. If both A and B refers to C, then if A migrates to another program, a remote reference to C can be created and the new object A only carries this remote reference with it. A and A are two distinct ....

J. Daniels and S. Cook. Strategies for sharing objects in distributed systems. Journal of ObjectOriented Programming, January 1993.

.... general problem: How to share objects between other objects that reside in different programs There are basically two approaches to solve the sharing problem in a distributed system: one copy (by remote access, see previous paragraph) or many copies (using some sort of replication protocol) DC93] Below we describe each of these approaches in turn. Figure 4 illustrates the one copy approach. If both A and B refer to C, then if A migrates to another program, a remote reference to C can be created and the new object A only carries this remote reference with it. A and A are two distinct ....

J. Daniels and S. Cook. Strategies for sharing objects in distributed systems. Journal of Object-Oriented Programming, January 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC