Skip to main content
SpringerLink
Log in

Musical Benches

  • Conference paper
Distributed Computing (DISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3724))

Included in the following conference series:

Abstract

We propose the musical benches problem to model a wait-free coordination difficulty that is orthogonal to previously studied ones such as agreement or symmetry breaking (leader election or renaming). A bench is the usual binary consensus problem for 2 processes. Assume n+1 processes want to sit in n benches as follows. Each one starts with a preference, consisting of a bench and one place (left or right) in the bench where it wants to sit. Each process should produce as output the place of the bench where it decides to sit. It is required that no two processes sit in different places of the same bench. Upon the observance of a conflict in one of the benches an undecided process can “abandon” its initial bench and place and try to sit in another bench at another place.

The musical benches problem is so called because processes jump from bench to bench trying to find one in which they may be alone or not in conflict with one another. If at most one process starts in each bench, the problem is trivially solvable– each process stays in its place. We show that if there is just one bench where two processes rather than one, start, the problem is wait-free unsolvable in read/write shared memory. This impossibility establishes a new connection between distributed computing and topology, via the Borsuk-Ulam theorem.

The musical benches problem seems like just a collection of consensus problems, where by the pigeon hole principle at least one of them will have to be solved by two processes. Consequently, one is tempted to try to find a bivalency impossibility proof of the FLP style. Our second result shows that there is no such proof: We present an algorithm to solve the musical benches problem using set agreement, a primitive stronger than read/write registers, but weaker than consensus. Thus, an FLP-style impossibility for musical benches will imply an FLP-style impossibility of set-consensus.

The musical benches problem can be generalized by considering benches other than consensus, such as set agreement or renaming, leading to a very interesting class of new problems.

This work has been supported by a grant from LAFMI (Franco-Mexican Lab in Computer Science), and from UNAM-PAPIIT

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. Journal of the ACM 40(4), 873–890 (1993)

    Article  MATH  Google Scholar 

  2. Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message-Passing Systems. Journal of the ACM 42(1), 124–142 (1995)

    Article  MATH  Google Scholar 

  3. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming In An Asynchronous Environment. Journal of the ACM 37(3), 524–548 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Attiya, H., Rachman, O.: Atomic Snapshots in O(nlogn) Operations. SIAM Journal of Computing 27(2), 319–340 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Attiya, H., Rajsbaum, S.: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM J. Comput. 31(4), 1286–1313 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91–100. ACM Press, New York (1993)

    Google Scholar 

  7. Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41–51. ACM Press, New York (1993)

    Chapter  Google Scholar 

  8. Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189–198. ACM Press, New York (1997)

    Chapter  Google Scholar 

  9. Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing 14(3), 127–146 (2001)

    Article  Google Scholar 

  10. Burns, J., Peterson, G.: The Ambiguity of Choosing. In: Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC), Edmonton, Alberta, Canada, August 14–16, pp. 145–157 (1989)

    Google Scholar 

  11. Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105, 132–158 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fekete, A.: Asymptotically Optimal Algorithms for Approximate Agreement. Distributed Computing 4, 9–29 (1990)

    Article  MathSciNet  Google Scholar 

  13. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gafni, E.: Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28–July 2, pp. 143–152 (1998)

    Google Scholar 

  15. Gafni, E.: DISC/GODEL presentation: R/W Reductions. October 4 (2004), http://www.cs.ucla.edu/~eli/eli/godel.ppt

  16. Gafni, E., Koutsoupias, E.: Three-Processor Tasks Are Undecidable. SIAM J. Comput. 28(3), 970–983 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gafni, E., Guerraoui, R., Pochon, B.: From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. In: Proc. 37th ACM Symposium on Theory of Computing (STOC 2005), Baltimore (MD) (May 2005)

    Google Scholar 

  18. Goubault, E.: A historical note on Geometry and Concurrency, http://www.di.ens.fr/~goubault/index1.html

  19. Havlicek, J.: Computable Obstructions to Wait-Free Computability. Distributed Computing 13(2), 59–83 (2000)

    Article  Google Scholar 

  20. Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on programming Languages and Systems 11(1), 124–149 (1991)

    Article  Google Scholar 

  21. Herlihy, M., Rajsbaum, S.: The Decidability of Distributed Decision Tasks (Extended Abstract). In: Proc. 29th ACM Symposium on the Theory of Computing (STOC 1997), May 1997, pp. 589–598. ACM Press, New York (1997)

    Google Scholar 

  22. Herlihy, M., Rajsbaum, S.: New Perspectives in Distributed Computing. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 170–186. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  23. Herlihy, H., Rajsbaum, S.: Algebraic spans. Mathematical Structures in Computer Science 10(4), 549–573 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  24. Herlihy, H., Rajsbaum, S.: A classification of wait-free loop agreement tasks. Theor. Comput. Sci. 291(1), 55–77 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  25. Herlihy, M., Rajsbaum, S., Tuttle, M.: Unifying Synchronous and Asynchronous Message-Passing Models. In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28–July 2, pp. 133–142 (1998)

    Google Scholar 

  26. Herlihy, M., Rajsbaum, S., Tuttle, M.: An Overview of Synchronous Message-Passing and Topology. Electr. Notes Theor. Comput. Sci. 39(2) (2001)

    Google Scholar 

  27. Herlihy, M., Rajsbaum, S., Tuttle, M.: An axiomatic approach to computing the connectivity of synchronous and asynchronous systems. In: Proc. of the 6th workshop on Geometric and Topological Methods in Concurrency and Distributed Computing (GETCO), October 4 (2004)

    Google Scholar 

  28. Hoest, G., Shavit, N.: Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), Santa Barbara, California, USA, August 21–24, pp. 199–208

    Google Scholar 

  29. Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858–923 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  30. Jayanti, P., Chandra, T., Toueg, S.: Fault-tolerant wait-free shared objects. Journal of the ACM 45(3), 451–500 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  31. Matousek, J.: Using the Borsuk-Ulam Theorem. Lectures on Topological Methods in Combinatorics and Geometry. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  32. Raynal, M.: Real-time dependable decisions in timed asynchronous distributed systems. In: Proc. 3rd Int. Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 1997), pp. 283–290. IEEE Computer Society Press, Newport Beach (1997)

    Chapter  Google Scholar 

  33. Tel, G.: Introduction to Distributed Algorithms, 2nd edn., February 15. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  34. Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing 29(5), 1449–1483 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, UCLA, Los Angeles, CA, 90024, USA

    Eli Gafni

  2. Math Institute, UNAM, Ciudad Universitaria, D.F., 04510, Mexico

    Sergio Rajsbaum

Authors
  1. Eli Gafni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gafni, E., Rajsbaum, S. (2005). Musical Benches. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_7

Download citation

  • DOI: https://doi.org/10.1007/11561927_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation