Advertisement

The Mailbox Problem

(Extended Abstract)
  • Marcos K. Aguilera
  • Eli Gafni
  • Leslie Lamport
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

We propose and solve a synchronization problem called the mailbox problem, motivated by the interaction between devices and processor in a computer. In this problem, a postman delivers letters to the mailbox of a housewife and uses a flag to signal a non-empty mailbox. The wife must remove all letters delivered to the mailbox and should not walk to the mailbox if it is empty. We present algorithms and an impossibility result for this problem.

Keywords

Shared Variable Synchronization Problem Atomic Step Impossibility Result Liveness Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM Journal on Computing 26(2), 418–455 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J.ACM 32(2), 374–382 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Herlihy, M.P.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)CrossRefGoogle Scholar
  4. 4.
    Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)CrossRefGoogle Scholar
  5. 5.
    Israeli, A., Li, M.: Bounded time-stamps. Distributed Computing 6(4), 205–209 (1993)zbMATHCrossRefGoogle Scholar
  6. 6.
    Lamport, L.: A new solution of Dijkstra’s concurrent programming problem. Communications of the ACM 17(8), 453–455 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Lamport, L.: The  +  cal algorithm language (July 2006), http://research.microsoft.com/users/lamport/tla/pluscal.html (The page can also be found by searching the Web for the 25-letter string obtained by removing the “-” from uid-lamportpluscalhomepage)
  8. 8.
    Lampson, B.W., Redell, D.D.: Experience with processes and monitors in Mesa. Communications of the ACM 17(8), 453–455 (1974)CrossRefGoogle Scholar
  9. 9.
    Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4, 163–183 (1987)MathSciNetGoogle Scholar
  10. 10.
    Saltzer, J.H.: Traffic control in a multiplexed computer system. Technical Report Project MAC Technical Report MAC-TR-30, M.I.T (June 1966)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Marcos K. Aguilera
    • 1
  • Eli Gafni
    • 1
    • 2
  • Leslie Lamport
    • 1
  1. 1.Microsoft Research Silicon Valley 
  2. 2.UCLA 

Personalised recommendations