Token-based read/write-locks for distributed mutual exclusion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1900, Issue , 2000, Pages 1185-1195

  Wagner, Claus ^a   Mueller, Frank ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AVERAGE COMPLEXITY; CONCURRENT EXECUTION; CRITICAL SECTIONS; DECENTRALIZED APPROACH; DISTRIBUTED MUTUAL EXCLUSION; FINE-GRAINED PARALLELISM; OVERALL EXECUTION; STATIC STRUCTURES;

QUERY LANGUAGES;

EID: 84937416631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44520-x_167     Document Type: Conference Paper

References (15)

1. Y. Chang. A simulation study on distributed mutual exclusion. J. Parallel Distrib. Comput., 33(2):107–121, March 1996.
2. Y. Chang, M. Singhal, and M. Liu. An improved O(log(n)) mutual exclusion algorithm for distributed processing. In Int. Conference on Parallel Processing, volume 3, pages 295–302, 1990.
3. S. Fu, N. Tzeng, and Z. Li. Empirical evaluation of distributed mutual exclusion algorithms. In International Parallel Processing Symposium, pages 255–259, 1997.
4. T. Johnson. A performance comparison of fast distributed mutual exclusion algorithms. In Proc. 1995 Int. Conf. on Parallel Processing, pages 258–264, 1995.
5. A. Kumar. Hierachical quorum consensus: A new algorithm for managing replicated data. IEEE Trans. On Computers, 40(9):994–1004, 1991.
6. L. Lamport. Time, clocks and ordering of events in distributed systems. Comm. ACM, 21(7):558–565, June 1978.
7. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Systems, 7(4):321–359, November 1989.
8. M. Maekawa. A sqrt(n) algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3(2):145–159, 1985.
9. F. Mueller. Prioritized token-based mutual exclusion for distributed systems. In International Parallel Processing Symposium, pages 791–795, 1998.
10. M. Naimi, M. Trehel, and A. Arnold. A log(N) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput., 34(1):1–13, April 1996.
11. M. L. Neilsen and M. Mizuno. A dag-based algorithm for mutual exclusion. In Distributed Computer Systems, pages 354–360, 1991.
12. K. Raymond. A distributed algorithm for multiple entries to a critical section. Information Processing Letters, 30(4):189–193, February 1989.
13. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Systems, 7(1):61–77, February 1989.
14. P. Srimani and R. Reddy. Another distributed algorithm for multiple entries to a critical section. Information Processing Letters, 41(1):51–57, January 1992.
15. C. Wagner. Algorithmen zum gegenseiten Ausschluß in verteilten Systemen. Master’s thesis, Humboldt University Berlin, Germany, December 1999.