Advertisement

On the Mailbox Problem

  • Uri Abraham
  • Gal Amram
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8878)

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.

Keywords

distributed algorithms shared memory synchronization linearizability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 2.
    Aguilera, M.K., Gafni, E., Lamport, L.: The Mailbox Problem. Distributed Computing 23, 113–134 (2010)CrossRefzbMATHGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 4.
    Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Languag. Syst. 11(1), 124–149 (1991)CrossRefGoogle Scholar
  5. 5.
    Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12, 463–492 (1990)CrossRefGoogle Scholar
  6. 6.
    Lamport, L.: A new solution of dijkstraś concurrent programming problem. Communications of the ACM 17(8), 453–455 (1974)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Lamport, L.: On Interprocess Communication, Part I: Basic formalism, Part II: Algorithms. Distributed Computing 1, 77–101 (1986)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Uri Abraham
    • 1
  • Gal Amram
    • 1
  1. 1.Ben-Gurion UniversityBeer-ShevaIsrael

Personalised recommendations