Object-based protocol for replicated objects

Objects support abstract methods in object-based systems. We discuss a novel object-based locking (OBL) protocol to lock replicated objects by extending the quorum-based protocol handling read and write requests to abstract methods. Unless two methods op/sub 1/ and op/sub 2/ conflict, the quorum sets of the methods may not intersect even if op/sub 1/ and op/sub 2/ update the replicas. Here, a pair of replicas A and B compute op/sub 1/ and opt, respectively. If op/sub 1/ and op/sub 2/ do not conflict, A and B can later compute op/sub 2/ and op/sub 1/, respectively. We newly propose a version vector to identify what methods are computed on a replica. We discuss the OBL protocol where the replicas exchange the compatible methods by using the version vector.

[1]  Ahmed K. Elmagarmid,et al.  Distributed lock management for mobile transactions , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[2]  Miron Livny,et al.  Conflict detection tradeoffs for replicated data , 1991, TODS.

[3]  Douglas C. Schmidt,et al.  Constructing reliable distributed communication systems with CORBA , 1997, IEEE Commun. Mag..

[4]  Makoto Takizawa,et al.  Model of Mobile Objects , 1996, DEXA.

[5]  Henry F. Korth,et al.  Locking Primitives in a Database System , 1983, JACM.

[6]  Philip A. Bernstein,et al.  The failure and recovery problem for replicated databases , 1983, PODC '83.

[7]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[8]  Pierre-Yves Chevalier,et al.  A replicated object server for a distributed object-oriented system , 1992, [1992] Proceedings 11th Symposium on Reliable Distributed Systems.