Skip to main content

On the Mailbox Problem

  • Conference paper
Book cover Principles of Distributed Systems (OPODIS 2014)

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

Included in the following conference series:

Abstract

The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport in [2] with a mailbox algorithm that uses two flag registers that carry 14 values each. An interesting question that they ask is whether leaner solutions exists. In addition to their algorithm, the authors of [2] proved that the mailbox problem cannot be solved with 1 bit flags. In this paper, we show that 2 bit flags suffice by presenting a mailbox algorithm with two bit flags. The space complexity of Aguilera et al. solution is O(nlogn) and they conjectured that a solution with space complexity O(logn) exists. Our algorithm proves this conjecture. We also prove that there is no mailbox algorithm with a smaller space complexity.

Research partially supported by the Frankel Center for Computer Science at Ben-Gurion University.

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

Access this chapter

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. Aguilera, M.K., Gafni, E., Lamport, L.: The Mailbox Problem (Extended Abstract). In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 1–15. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Aguilera, M.K., Gafni, E., Lamport, L.: The Mailbox Problem. Distributed Computing 23, 113–134 (2010)

    Article  MATH  Google Scholar 

  3. Amram, G.: On the Signaling Problem. In: Chatterjee, M., Cao, J.-n., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 44–65. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  4. Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Languag. Syst. 11(1), 124–149 (1991)

    Article  Google Scholar 

  5. Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12, 463–492 (1990)

    Article  Google Scholar 

  6. Lamport, L.: A new solution of dijkstraś concurrent programming problem. Communications of the ACM 17(8), 453–455 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lamport, L.: On Interprocess Communication, Part I: Basic formalism, Part II: Algorithms. Distributed Computing 1, 77–101 (1986)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Abraham, U., Amram, G. (2014). On the Mailbox Problem. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds) Principles of Distributed Systems. OPODIS 2014. Lecture Notes in Computer Science, vol 8878. Springer, Cham. https://doi.org/10.1007/978-3-319-14472-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14472-6_30

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14471-9

  • Online ISBN: 978-3-319-14472-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics