A log(n) multi-mode locking protocol for distributed systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Desai, Nirmit ^a   Mueller, Frank ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; RESPONSE TIME (COMPUTER SYSTEMS); SCALABILITY;

DISTRIBUTED AGREEMENT; DISTRIBUTED SYSTEMS; HIERARCHICAL LOCKING; HIGH PERFORMANCE CLUSTER; HIGH SCALABILITIES; LARGE-SCALE CLUSTERS; PEER-TO-PEER PROTOCOLS; SCIENTIFIC APPLICATIONS;

LOCKS (FASTENERS);

EID: 84947293284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213077     Document Type: Conference Paper

References (19)

1. Top 500 list. http://www. Top500. org/, June 2002.
2. B. R. Badrinath and K. Ramamritham. Performance evaluation of semantics-based multilevel concurrency control protocols. SIGMOD Record (ACM Special Interest Group on Management of Data), 19(2):163-172, June 1990.
3. D. Brunsch, C. O'Ryan, and D. C. Schmidt. Designing an efficient and scalable server-side asynchrony model for CORBA. In C. Norris and J. B. F. Jr. , editors, Workshop on Optimization of Middleware and Distributed Systems (OM-01), volume 36, 6 of SIGPLAN Notices, pages 223-229, June 18 2001.
4. Y. Chang. A simulation study on distributed mutual exclusion. J. Parallel Distrib. Comput. , 33(2):107-121, Mar. 1996.
5. 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.
6. N. Desai and F. Mueller. Scalable hierarchical locking for distributed systems. J. Parallel Distrib. Comput. , page (submitted), 2003.
7. D. Dolev and D. Malik. The transis approach to high availability cluster communication. Commun. ACM, 39(4):64-70, Apr. 1996.
8. C. Engelmann, S. Scott, and G. Geist. Distributed peer-topeer control in harness. In ICCS, 2002.
9. J. Gray, R. A. Lorie, G. R. Putzolu, and I. L. Traiger. Granularity of locks in a large shared data base. In D. S. Kerr, editor, Proceedings of the International Conference on Very Large Data Bases, pages 428-451, Framingham, Massachusetts, 22-24 Sept. 1975. ACM.
10. O. M. Group. Concurrency service specification. http://www. omg. org/tech-nology/docu-ments/formal/concurrency service. htm, Apr. 2000.
11. T. Johnson. A performance comparison of fast distributed mutual exclusion algorithms. In Proc. 1995 Int. Conf. on Parallel Processing, pages 258-264, 1995.
12. U. Kelter. Synchronizing shared abstract data types with intention locks. Technical report, University of Osnabrueck, 1985.
13. J. Lee and A. Fekete. Multi-granularity locking for nested transactions: A proof using a possibilities mapping. Acta Informatica, 33(2):131-152, 1996.
14. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Systems, 7(4):321-359, Nov. 1989.
15. F. Mueller. Prioritized token-based mutual exclusion for distributed systems. In International Parallel Processing Symposium, pages 791-795, 1998.
16. F. Mueller. Priority inheritance and ceilings for distributed mutual exclusion. In IEEE Real-Time Systems Symposium, pages 340-349, Dec. 1999.
17. 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, Apr. 1996.
18. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Systems, 7(1):61-77, Feb. 1989.
19. D. C. Schmidt, D. L. Levine, and S. Mungee. The design of the TAO real-time object request broker. Computer Communications, 21(4), Apr. 1998.