Abstract
The HIDRA Concurrency Control (HCC) mechanism provides support for concurrency control in environments where the coordi-nator-cohort replication model is being used. This replication model allows the arrival of multiple invocations to different object replicas which serve locally those invocations and later make the appropriate checkpoints on the rest of replicas. The HCC uses a service serialiser object (SS) and a set of serialiser agents placed in each replica node. As a result, since the HCC components are replicated, this mechanism is also fault tolerant. Each invocation received by an object replica is processed by the SS which knows the invocations that are currently being processed. So, this agent is able to block or allow the execution of arriving invocations according to their conflicts with the currently active ones and the concurrency specification made when the object interface was declared.
This work was partially supported by the CICYT (Comisión Interministerial de Ciencia y Tecnología) under project TIC96-0729
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. M. Bernabéu-Aubán and M. Ahamad. Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm. In J. C. Bermond and M. Raynal, editors, 3rd International Workshop on Distributed Algorithms, Nice, France, LNCS, pages 33–44. Springer-Verlag, sep 1989.
K. P. Birman, T. Joseph, and T. Raeuchle. Concurrency control in resilient objects. Technical report, TR 84-622, Dept. of Computer Science, Cornell Univ., Ithaca, NY, July 1984.
Toby Bloom. Evaluating synchronisation mechanisms. In 7th International ACM Symposium on Operating System Principles, pages 24–32, 1979.
P. Galdámez, F. D. Muñoz-Escoí, and J. M. Bernabéu-Aubán. High availability support in CORBA environments. In F. Plášil and K. G. Jeffery, editors, 24th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, volume 1338 of LNCS, pages 407–414. Springer Verlag, November 1997.
Jim Gray. Notes on database operating systems. In R. Bayer, R. Graham, and G. Seegmuller, editors, Operating Systems: An Advanced Course. Springer-Verlag, 1979.
M. Herlihy. Apologizing versus asking permission: Optimistic concurrency control for abstract data types. ACM Trans. on Database Sys., 15(1):96–124, March 1990.
S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. on Database Sys., 15(2):230–280, June 1990.
A. Kumar and A. Segev. Cost and availability tradeoffs in replicated data concurrency control. ACM Trans. on Database Sys., 18(1):102–131, March 1993.
Ciaran McHale. Synchronisation in Concurrent, Object-oriented Languages: Expressive Power, Genericity and Inheritance. PhD thesis, Department of Computer Science, Trinity College, Dublin, Ireland, October 1994.
F. D. Muñoz-Escoí, P. Galdámez, and J. M. Bernabéu-Aubán. ROI: An invocation mechanism for replicated objects. In Proc. of the 17th IEEE Symposium on Reliable Distributed Systems, West Lafayette, IN, USA, October 1998.
OMG. The Common Object Request Broker: Architecture and Specification. Object Management Group, February 1998. Revision 2.2.
U. S. Dept. of Defense. Reference manual of the Ada programming language. Technical report, ANSI/MIL-STD-1815A, DoD, Washington,D.C., 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muñoz-Escoí, F.D., Galdámez, P., Bernabéu-Aubán, J.M. (1998). A Synchronisation Mechanism for Replicated Objects. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_31
Download citation
DOI: https://doi.org/10.1007/3-540-49477-4_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65260-1
Online ISBN: 978-3-540-49477-5
eBook Packages: Springer Book Archive