Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-mailbox-problem-v7W6rwPRmK
References (23)
-
G. Graham
A New Solution of Dijkstra ' s Concurrent Programming Problem -
Yuan Yu, P. Manolios, L. Lamport (1999)
Model Checking TLA+ Specifications -
L. Lamport (1977)
Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, SE-3
-
J. Saltzer (1966)
Traffic control in a multiplexed computer system -
David Thompson, Joshua Levine, Janine Bennett, P. Bremer, A. Gyulassy, Valerio Pascucci, P. Pébay (2011)
Analysis of large-scale scalar data using hixels2011 IEEE Symposium on Large Data Analysis and Visualization
-
L. Lamport (2009)
The PlusCal Algorithm Language -
(1987)
Memory requirements for agreement among unreliable asynchronous processes -
B.W. Lampson, D.D. Redell (1980)
Experience with processes and monitors in mesaCommun. ACM, 23
-
L. Lamport (1994)
The temporal logic of actionsACM Trans. Program. Lang. Syst., 16
-
M. Abadi, L. Lamport (1988)
The existence of refinement mappings[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
-
M. Fischer, N. Lynch, M. Paterson (1983)
Impossibility of distributed consensus with one faulty process -
M. Herlihy, Jeannette Wing (1987)
Axioms for concurrent objects -
N. Lynch (1994)
Distributed Algorithms, 857
-
(1986)
Lamport L (1986) On interprocess communication—part II: Algorithms -
J. Saltzer (1966)
TRAFFIC CONTROL IN A MULTIPLEXED COMPUTER -
M. Herlihy (1991)
Wait-free synchronizationACM Trans. Program. Lang. Syst., 13
-
L. Lamport (1986)
On interprocess communication—part II: algorithmsDistrib. Comput., 1
-
M. Herlihy, Jeannette Wing (1990)
Linearizability: a correctness condition for concurrent objectsACM Trans. Program. Lang. Syst., 12
-
L. Lamport (1974)
A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 17
-
D. Dolev, N. Shavit (1997)
Bounded Concurrent Time-StampingSIAM J. Comput., 26
-
G. Peterson (1983)
Concurrent Reading While WritingACM Trans. Program. Lang. Syst., 5
-
L. Lamport (2006)
The +CAL Algorithm Language -
A. Israeli, Ming Li (1987)
Bounded time-stampsDistributed Computing, 6
- Publisher
- Springer Journals
- Copyright
- Copyright © 2010 by Springer-Verlag
- Subject
- Computer Science; Theory of Computation; Software Engineering/Programming and Operating Systems; Computer Systems Organization and Communication Networks; Computer Hardware; Computer Communication Networks
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-010-0102-8
- Publisher site
- See Article on Publisher Site
Abstract
We propose and solve a synchronization problem called the mailbox problem, motivated by a particular type of interaction between a processor and an external device or between two threads. In this problem, a postman delivers letters to the mailbox of a home owner and uses a flag to signal a non-empty mailbox. The owner 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.
Journal
Distributed Computing – Springer Journals
Published: May 1, 2010