Abstract
We propose a new resource sharing problem, called Local Resource Allocation (LRA) which deals with resource sharing problem among neighboring processes. LRA allows neighboring processes to access resources (i.e., their critical sections) concurrently provided the resources are not conflicting with each other. We first present a self-stabilizing solution to the LRA problem. We then use the proposed solution to design a self-stabilizing transformer to transform algorithms written using strong assumptions (e.g., central daemon or composite atomicity) to those using weaker assumptions (distributed read/write atomicity model). To our knowledge, this is the first self-stabilizing transformer which allows neighborhood concurrency. Moreover, the proposed solution preserves the silent property of the original algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Antonoiu and P.K. Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In Euro-par’99 Parallel Processing, Proceedings, Springer-Verlag LNCS:1685, pages 824–830, 1999. 103
A. Arora and M.G. Gouda. Distributed reset. IEEE Transactions on Computers, 43:1026–1038, 1994. 111
J. Beauquier, A.K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In Proceedings of the 14th International Conference on Distributed Computing (DISC 2000), Springer-Verlag LNCS:1914, pages 223–237, 2000. 103, 111
J. Beauquier, M. Gradinariu, and C. Johnen. Cross-over composition — enforcement of fairness under unfair adversary. In Proceedings of the Fifth Workshop on Self-Stabilizing Systems, Springer-Verlag LNCS:2194, pages 19–34, 2001.
K.M. Chandy and J. Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632–646, 1984. 102, 106
P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with readers and writers. Communications of the Association of the Computing Machinery, 14(10):667–668, 1971. 102
E.W. Dijkstra. Solution to a problem in concurrent programming control. Communications of the Association of the Computing Machinery, 8(9):569, 1965. 102
E.W. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643–644, 1974. 102
E.W. Dijkstra. Two starvation-free solutions of a general exclusion problem. Technical Report EWD 625, Plataanstraat 5, 5671, AL Nuenen, The Netherlands, 1978. 102
S. Dolev, M. Gouda, and M. Schneider. Memory requirements for silent stabilization. In PODC96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pages 27–34, 1996. 103
S. Dolev and T. Herman. Parallel composition of stabilizing algorithms. In Proceedings of the Fourth Workshop on Self-Stabilizing Systems, IEEE Computer Society, pages 25–32. IEEE Computer Society Press, 1999.
S. Dolev, A. Israeli, and S. Moran. Self-stabilizing of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993. 103, 104
M. Gouda and F. Haddix. The alternator. In Proceedings of the Fourth Workshop on Self-Stabilizing Systems, IEEE Computer Society, pages 48–53, 1999. 103, 111
M. G. Gouda and T. Herman. Adaptive programming. IEEE Transactions on Software Engineering, 17:911–921, 1991.
Y.-J. Joung. Asynchronous group mutual exclusion (extended abstract). In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 51–60, June 28–July 2 1998. 102
H. Kakugawa and M. Yamashita. Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct. In Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS2002), pages 202–211, 2002. 103, 111
P. Keane and M. Moir. A general resource allocation synchronization problem. In Proceedings of the 23th IEEE International Conference on Distributed Computing Systems (ICDCS), pages 557–566. ACM Press, 2001. 102
L. Lamport. A new solution of Dijkstra’s concurrent programming problem. Communications of the ACM, 17(8):453–455, 1974. 102
L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, 1978. 103, 106
M. Mizuno and H. Kakugawa. A timestamp based transformation of self-stabilizing programs for distributed computing environments. In WDAG96 Distributed Algorithms 10th International Workshop Proceedings, Springer-Verlag LNCS:1151, pages 304–321, 1996. 103
M. Mizuno and Nesterenko. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Information Processing Letters, 66(6):285–290, 1998. 103, 107, 108, 111
M. Nesterenko and A. Arora. Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing, 62(5):766–791, 2002. 103, 111
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cantarell, S., Datta, A.K., Petit, F. (2003). Self-Stabilizing Atomicity Refinement Allowing Neighborhood Concurrency. In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-45032-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40453-8
Online ISBN: 978-3-540-45032-0
eBook Packages: Springer Book Archive