Abstract
Room synchronization problem was first introduced by Joung in 1998 and widely studied subsequently. The problem arises in various practical applications that require concurrent data sharing. The problem aims at achieving exclusive access to shared data while facilitating suitable concurrency.
This is a preview of subscription content, log in via an institution to check access.
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
K. Alagarsamy and K. Vidyasankar, “Fair and Efficient Mutual Exclusion Algorithms,” Lecture Notes in Computer Science, vol. 1693, pp. 166-179, 1999.
G.E. Blelloch, P. Cheng, and P.B. Gibbons, “Room synchronizations”, Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pp. 122-133, 2001.
G.E. Blelloch, P. Cheng, and P.B. Gibbons, “Scalable room synchronizations”, Theory of Computing Systems, vol. 36, pp. 397-430, 2003.
E.W. Dijkstra, “Solution of a problem in concurrent programming control” Communications of the ACM, vol. 8, no. 9, pp. 569, 1965.
R. Danek and V. Hadzilacos, “Local-spin Group Mutual Exclusion Algorithms”, Lecture Notes in Computer Science, vol. 3274, pp. 71-85, 2004.
Hadzilacos, “A note on group mutual exclusion” Proceedings of the ACM symposium on PODC, pp. 100-106, 2001.
P. Jeyanti, S. Petrovic, and K. Tan, “Fair group mutual exclusion” Proceedings of the ACM Symposium on PODC, pp. 275-284, 2003.
Y. Joung, “Asynchronous group mutual exclusion”, Proceedings of the ACM symposium on PODC, pp. 51-60, 1998
Y. Joung, “Asynchronous group mutual exclusion” Distributed Computing, vol. 13, pp. 189-206, 2000.
D. E. Knuth, “Additional comments on a problem in concurrent programming problem” Communications of the ACM, vol. 9, no. 5, pp. 321-322, 1966.
P. Kean and M. Moir, “A simple local-spin group mutual exclusion algorithm” Proceedings of the ACM Symposium on PODC, pp. 23-32, 1999.
P. Kean and M. Moir, “A simple local-spin group mutual exclusion algorithm” IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 7, pp. 23-32, 2001.
L. Lamport, “A new solution of Dijkstra’s concurrent programming problem” Communications of the ACM, vol. 17, no. 8, pp. 453-455, 1974.
G.L. Peterson, “Myths about the mutual exclusion problem” Information Processing Letters, vol. 12, no. 3, pp. 115-116, 1981.
S. Petrovic, “Space-efficient FCFS group mutual exclusion”, Information Processing Letters, vol. 95, pp. 343-350, 2005.
M. Takamura and Y. Igarashi, Highly concurrent group mutual exclusion algorithms based on ticket orders, IEICE Transactions on Information and Systems, vol. E87-D(2), pp. 322-329, 2004.
K. Vidyasankar, “A Simple group mutual l-exclusion algorithm”, Information Processing Letters, vol. 85, pp. 79-85, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Aravind, A.A. (2007). A Simple and Efficient Solution for Room Synchronization Problem in Distributed Computing. In: Elleithy, K. (eds) Advances and Innovations in Systems, Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6264-3_5
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6264-3_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6263-6
Online ISBN: 978-1-4020-6264-3
eBook Packages: EngineeringEngineering (R0)