A bounded first-in, first-enabled solution to the l-exclusion problem
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
This paper presents a solution to the first-in, first out l-exclusion problem of [FLBB79]. Unlike the solution in [FLBB79], this solution is achieved without the use of powerful readmodify-write synchronization primitives, and it requires only bounded size shared memory. Moreover, this solution has the extra property of being first-in, first-enabled, a property which subsumes first-in, first-out. Use of the concurrent time-stamp system of [DS89] is key in solving the problem within bounded size shared memory.
- H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in an asynchronous environment. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 337–346, October 1987.
- J. H. Anderson, and M. G. Gouda, The virtue of patience: concurrent programming with and without waiting. unpublished manuscript, Dept. of Computer Science, Austin, Texas, January 1988.
- D. Dolev, E. Gafni, and N. Shavit. Towards a non-atomic era: l-exclusion as a test case. In Proceedings of the 20 th Annual ACM Symposium on Theory of Computing. ACM SIGACT, ACM, 1988.
- E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8:165, 1965.
- D. Dolev and N. Shavit. Bounded concurrent time-stamp systems are constructible. In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454–465. ACM SIGACT, ACM, 1989.
- M. Fischer, N. Lynch, J. Burns, and A. Borodin. Resource allocation with immunity to limited process failure. In Proceedings of 20th FOCS, pages 234–254, October 1979.
- M. Fischer, N. Lynch, J. Burns, and A. Borodin. Distributed fifo allocation of identical resources using small shared space. ACM Transactions on Programming Languages and Systems, 11(1):90–114, January 1989.
- M. P. Herlihy, Wait free implementations of concurrent objects, Proc. 7th ACM Symp. on Principles of Distributed Computing, 1988, pp. 276–290.
- H. Katseff. A new solution to the critical section problem. In Proceedings of the 10 th Annual ACM Symposium on Theory of Computing, pages 86–88. ACM, 1978.
- L. Lamport. A new solution of dijkstra's concurrent programming problem. Communications of the ACM, 78(8):453–455, 1974.
- L. Lamport, On interprocess communication. Part I: Basic formalism. Distributed Computing 1, 2 1986, 77–85.
- L. Lamport, On interprocess communication. Part II: Algorithms. Distributed Computing 1, 2 1986, pp. 86–101.
- Leslie Lamport. The mutual exclusion problem.part ii: Statement and solutions. J. ACM, 33(2):327–348, 1986.
- G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115–116, 1981.
- G. L. Peterson, Concurrent reading while writing. ACM Transactions on Programming Languages and Systems, Vol. 5, No. 1 (January 1983), pp. 46–55.
- G. Peterson. personal communication. unpublished, 1988.
- Larry Rudolph. Software Structures for Ultra-Parallel Computing. PhD thesis, New York University, 1981.
- A bounded first-in, first-enabled solution to the l-exclusion problem
- Book Title
- Distributed Algorithms
- Book Subtitle
- 4th International Workshop Bari, Italy, September 24–26, 1990 Proceedings
- pp 422-431
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
- Author Affiliations
- 1. AT&T Bell Laboratories and Tel-Aviv University, Israel
- 2. IBM Almaden Research Center and Hebrew University Jerusalem, Israel
- 3. Tel-Aviv University, Israel
- 4. AT&T Bell Laboratories, USA
- 5. IBM Almaden Research Center and Stanford University, USA
To view the rest of this content please follow the download PDF link above.