Wait-Free Solvability of Colorless Tasks in Anonymous Shared-Memory Model | SpringerLink
Skip to main content
Springer Nature Link
Log in

Wait-Free Solvability of Colorless Tasks in Anonymous Shared-Memory Model

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2016)

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

Abstract

We investigate the capability of distributed systems in the anonymous asynchronous shared-memory model, in which processes have no identifiers and communicate through multi-writer/multi-reader atomic registers. The present paper assumes that an arbitrary number of processes may fail by crashing.

We propose a full-information protocol for colorless tasks and give a topological characterization of colorless tasks that are wait-free solvable in the anonymous model. The characterization implies, as long as colorless tasks are concerned, that the anonymity does not reduce the computational power of the asynchronous shared-memory model.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)

    Article  MATH  Google Scholar 

  2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of 12th ACM Symposium on Theory of Computing, pp. 82–93. ACM, New York (1980)

    Google Scholar 

  3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  MATH  Google Scholar 

  4. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524–548 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared memory systems. Inf. Comput. 173(2), 162–183 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132–158 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chothia, T., Chatzikokolakis, K.: A survey of anonymous peer-to-peer file-sharing. In: Enokido, T., Yan, L., Xiao, B., Kim, D., Dai, Y., Yang, L.T. (eds.) EUC 2005. LNCS, vol. 3823, pp. 744–755. Springer, Heidelberg (2005). doi:10.1007/11596042_77

    Chapter  Google Scholar 

  8. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., et al.: Byzantine agreement with homonyms. In: Proceedings of 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 21–30. ACM, New York (2011)

    Google Scholar 

  9. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., et al.: Byzantine agreement with homonyms. Distrib. Comput. 26(5–6), 321–340 (2013)

    Article  MATH  Google Scholar 

  10. Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Byzantine agreement with homonyms in synchronous systems. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol. 7129, pp. 76–90. Springer, Heidelberg (2012). doi:10.1007/978-3-642-25959-3_6

    Chapter  Google Scholar 

  11. Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499–516 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ellen, F., Fatourou, P., Ruppert, E.: The space complexity of unbounded timestamps. Distrib. Comput. 21(2), 103–115 (2008)

    Article  MATH  Google Scholar 

  13. Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distrib. Comput. 16(2–3), 121–163 (2003)

    Article  Google Scholar 

  14. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Gafni, E., Koutsoupias, E.: Three-processor tasks are undecidable. SIAM J. Comput. 28(3), 970–983 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distrib. Comput. 20(3), 165–177 (2007)

    Article  MATH  Google Scholar 

  17. Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco (2013)

    MATH  Google Scholar 

  18. Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks. In: Proceedings of Symposium on Theory of Computing, pp. 589–598. ACM, New York (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 105–113. ACM, New York (2010)

    Google Scholar 

  21. Herlihy, M., Rajsbaum, S.: Simulations and reductions for colorless tasks. In: Proceedings of 2012 ACM Symposium on Principles of Distributed Computing, pp. 253–260. ACM, New York (2012)

    Google Scholar 

  22. Herlihy, M., Rajsbaum, S., Raynal, M.: Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509, 3–24 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. Herlihy, M., Rajsbaum, S., Raynal, M., Stainer, J.: Computing in the presence of concurrent solo executions. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 214–225. Springer, Heidelberg (2014). doi:10.1007/978-3-642-54423-1_19

    Chapter  Google Scholar 

  24. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  25. Jayanti, P., Toueg, S.: Wakeup under read/write atomicity. In: Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 277–288. Springer, Heidelberg (1991). doi:10.1007/3-540-54099-7_19

    Chapter  Google Scholar 

  26. Junqueira, F.P., Marzullo, K.: Synchronous consensus for dependent process failures. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 274–283. IEEE (2003)

    Google Scholar 

  27. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

  28. Mendes, H., Tasson, C., Herlihy, M.: Distributed computability in Byzantine asynchronous systems. In: Proceedings of 46th ACM Symposium on Theory of Computing, pp. 704–713. ACM, New York (2014)

    Google Scholar 

  29. Ruppert, E.: The anonymous consensus hierarchy and naming problems. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 386–400. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77096-1_28

    Chapter  Google Scholar 

  30. Spanier, E.: Algebraic Topology, vol. 55. McGraw-Hill, New York (1966). (reprinted by Springer-Verlag)

    MATH  Google Scholar 

Download references

Acknowledgement

I would like to express my gratitude to Prof. Susumu Nishimura for enlightening discussion and helpful advice on writing this paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Graduate School of Science, Kyoto University, Kyoto, 606-8502, Japan

    Nayuta Yanagisawa

Authors
  1. Nayuta Yanagisawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nayuta Yanagisawa .

Editor information

Editors and Affiliations

  1. McMaster University, Hamilton, Ontario, Canada

    Borzoo Bonakdarpour

  2. LIP6, INRIA, UPMC Sorbonne Universities, Paris, France

    Franck Petit

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Yanagisawa, N. (2016). Wait-Free Solvability of Colorless Tasks in Anonymous Shared-Memory Model. In: Bonakdarpour, B., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2016. Lecture Notes in Computer Science(), vol 10083. Springer, Cham. https://doi.org/10.1007/978-3-319-49259-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49259-9_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49258-2

  • Online ISBN: 978-3-319-49259-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics