Arbitration-free synchronization

Distributed Computing

Volumn 16, Issue 2-3, 2003, Pages 219-237

  Lamport, Leslie ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Arbiter; Marked graphs; Multiprocess synchronization

Indexed keywords

ALGORITHMS; GRAPH THEORY; MULTIPROCESSING PROGRAMS; SYNCHRONIZATION;

SHARED REGISTERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0141610190     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0076-2     Document Type: Conference Paper

References (21)

1. Anderson JH, Gouda MG (1991) A new explanation of the glitch phenomenon. Acta Informatica 28(4): 297-309
2. Chancy TJ, Molnar CE (1973) Anomalous behavior of synchronizer and arbiter circuits. IEEE Trans Comput C-22: 421-422
3. Commoner F, Holt AW, Even S, Pnueli A (1971) Marked directed graphs. Journal of Computer and System Sciences 5(6): 511-523
4. Courtois PJ, Heymans F, Parnas DL (1971) Concurrent control with "readers" and "writers". Communications of the ACM 14(10): 667-668
5. Dijkstra EW (1971) Hierarchical ordering of sequential processes. Acta Informatica 1: 115-138
6. Dijkstra EW, Lamport L, Martin AJ, Scholten CS, Steffens EFM (1978) On-the fly garbage collection: an exercise in cooperation. Communications of the ACM 21(11): 966-975
7. Herlihy MP (1991) Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1): 124-149
8. Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7): 558-565
9. Lamport L Buridan's principle. Currently available from http://research.microsoft.com/users/lamport/pubs/pubs.html, or by searching the Web for the 23-letter string obtained by removing the - characters from all-lamports-pubs-onthe-web, January 1986
10. Lamport L (1986) The mutual exclusion problem - part i: A theory of interprocess communication. Journal of the ACM 33(2): 313-326
11. Lamport L (1986) On interprocess communication. Distributed Computing 1: 77-101
12. Lamport L (1985) On interprocess communication - part i: Basic formalism. Distributed Computing 1: 77-85
13. Lamport L (1986) On interprocess communication - part ii: Algorithms. Distributed Computing 1:86-101
14. Manna Z, Pnueli A The Temporal Logic of Reactive and Concurrent Systems. New York: Springer 1991
15. Marino LR (1981) General theory of metastable operation. IEEE Transactions on Computers C-30(2): 107-115,
16. Mead C, Conway L Introduction to VLSI Systems, chapter 7. Reading, Mass.: Addison-Wesley 1980
17. Milner R A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Berlin Heidelberg New York: Springer 1980
18. Reisig W Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Berlin Heidelberg New York: Springer 1998
19. Sutherland IE (1989) Micropipelines. Communications of the ACM 32(6): 720-738
20. Verhoeff T Analyzing specifications for delay-insensitive circuits. In Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and Systems, pp 172-183, San Diego, California, 1989
21. Verhoeff T A Theory of Delay-Insensitive Systems. PhD thesis, Eindhoven University of Technology, May 1994