Fast timing-based algorithms

Distributed Computing

Volumn 10, Issue 1, 1996, Pages 1-10

  Alur, Rajeev ^a   Taubenfeld, Gadi ^a,b  

^a LUCENT TECHNOLOGIES   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Contention free complexity; Mutual exclusion consensus; Shared memory algorithms; Timing based model

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; SYNCHRONIZATION;

MEMORY ACCESS TIME; MUTUAL CONSENSUS; MUTUAL EXCLUSION; SHARED MEMORY; TIME COMPLEXITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030192566     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050020     Document Type: Article

References (22)

1. Alur R, Attiya H, Taubenfeld G: Time-adaptive algorithms for synchronization. Proc 26th ACM Symposiom on Theory of Computing, pp 800-809. 1994. To appear in SIAM J Comput
2. Alur R, Itai A, Kurshan R, Yannakakis M: Timing verification by successive approximation. Inf Comput 118(1): 142-157 (1995)
3. Alur R, Taubenfeld G: Results about fast mutual exclusion. Proc 13th IEEE Real-Time Systems Symposion, pp 12-21, 1992
4. Alur R, Taubenfeld G: How to share an object: a fast timing-based solution. Proc of the 5th IEEE Symposion on Parallel and Distributed Processing, pp 470-477, 1993
5. Attiya H, Lynch N: Time bounds for real-time process control in the presence of timing uncertainty. Proc 10th Real-Time Systems Symposion, pp 268-284, 1989
6. Burns J, Lynch A: Bounds on shared memory for mutual exclusion. Inf Comput 107: 171-184(1993)
7. Choy M, Singh A: Adaptive solutions to the mutual exclusion problem. Proc 12th ACM Symposion on Principles of Distributed Computing, pp 183-194, 1993
8. Dijkstra, FW: Solution of a problem in concurrent programming control. Commun ACM 8(9): 569 (1965)
9. Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374-382 (1985)
10. Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 11(1): 124-149 (1991)
11. Lamport L: A fast mutual exclusion algorithm. ACM Trans Comput Syst 5(1): 1-11 (1987)
12. Loui CM, Abu-Amara H: Memory requirements for agreement among unreliable asynchronous processes. Adv Comput Res 4: 163-183 (1987)
13. Lynch N, Shavit N: Timing-based mutual exclusion. Proc of the 13th IEEE Real-Time Systems Symposium, pp 2-11, 1992
14. MacBlane MR: Source level atomic test-and-set for the TUXEDO System source product. UNIX System Laboratories, May 14, 1991
15. Manna Z, Pnueli A: The temporal logic of reactive and concurrent systems. Springer. Barlin Heidelberg New York 1991
16. Owicki S, Gries D: An axiomatic proof technique for parallel programs. Acta Inf 6(4) (1976)
17. Owicki S, Lamport L: Proving liveness properties of concurrent programs. ACM Trans Program Lang Syst 4(3): 455-595 (1982)
18. Peterson GL, Fischer MJ: Economical solutions for the critical section problem in a distributed system. Proc 9th ACM Symposion on Theory of Computing, pp 91-97, 1977
19. Pnueli A: The temporal logic of programs. Proc 18th Symposion on Foundations of Computer Science, pp 46-77, 1977
20. Pease M, Shostak R, Lamport L: Reaching agreement in the presence of faults. J ACM 27(2): 228-234 (1980)
21. Styer E: Improving fast mutual exclusion. Proc 11th ACM Symposion on Principles of Distributed Computing, pp 159-168, 1992
22. TUXEDO System Release 4.0 Product Overview. AT&T, 1990