Abstract
An algorithm is presented which implements mutual exclusion for a system of n processes by means of protocol-controled communication on a (n + const.)-valued shared buffer. The algorithm uses a generalized test-and-set instruction, and schedules processes into their critical sections on a first-come, first-serve basis. The method can be extended to accomodate any queueing discipline defined as a function of the system history between consecutive idle periods.
This research was supported in part by the Office of Naval Research under Contract No. N00014-77-C-0536 through the University of Southern California, Los Angeles, Calif., USA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W., "Solution of a problem in concurrent programming control", CACM 8 (1965), 569.
Knuth, D.E., "Additional comments on a problem in concurrent programming control", CACM 9 (1966), 321.
de Bruijn, N.G., "Additional comments on a problem in concurrent programming control", CACM 10 (1967), 137.
Eisenberg, M.A., and M.R. McGuire, "Further comments on Dijkstra's concurrent control problem", CACM 15 (1972), 999.
Lamport, L., "A new solution of Dijkstra's concurrent programming problem", CACM 17 (1974), 453.
Cremers, A.B., and T.N. Hibbard, "An algebraic approach to concurrent programming control and related complexity problems", Symposium on Algorithms and Complexity, Pittsburgh, April 1976, (Copies available from the authors.)
Rivest, R.L., and V.R. Pratt, "The mutual exclusion problem for unreliable processes: preliminary report", 17th Symposium on Foundations of Computer Science, October 1976.
Peterson, G.L., and M.J. Fischer, "Economical solutions for the critical section problem in a distributed system", 9th Symposium on Theory of Computing, May 1977.
Cremers, A.B., and T.N. Hibbard, "Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable", 5th ICALP, Udine, Italy, Springer Lecture Notes in Computer Science 62, 165–176. July 1978.
Burns, J.E., M.J. Fischer, P. Jackson, N.A. Lynch, G.L. Peterson, "Shared Data Requirements for Implementation of Mutual Exclusion Using a Test-and-Set Primitive", Computer Science Tech. Rept. 3, University of Washington, Seattle, August 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cremers, A.B., Hibbard, T.N. (1979). Arbitration and queueing under limited shared storage requirements. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive