A protocol for scalable distributed concurrency services

ABSTRACT

As researchers share computational resources, such as objects in large distributed environments, it becomes difficult to achieve scalability of synchronization. Concurrency protocols currently lack scalability. Our protocol enhances middleware concurrency services to provide scalability of synchronization enabling resource sharing and computing with distributed objects in systems with a large number of nodes.

REFERENCES

• 1: B. R. Badrinath , Krithi Ramamritham, Performance evaluation of semantics-based multilevel concurrency control protocols, ACM SIGMOD Record, v.19 n.2, p.163-172, Jun. 1990
• 2: Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, and Irving L. Traiger. Granularity of locks in a large shared database. In Douglas S. Kerr, editor, Proceedings of the International Conference on Very Large Databases, pages 428--451, Framingham, Massachusetts, 22-24 September 1975. ACM.
• 3: Object Management Group. Concurrency service specification. http://www.omg.org/technology/documents/formal/concurrency_service.htm, April 2000.
• 4: U. Kelter. Synchronizing shared abstract data types with intention locks. Technical report, University of Osnabrueck, 1985.
• 5: John Lee , Alan Fekete, Multi-granularity locking for nested transactions: a proof using a possibilities mapping, Acta Informatica, v.33 n.2, p.131-152, 1996 [doi>10.1007/s002360050038]
• 6: Suh-Yin Lee , Ruey-Long Liou, A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems, IEEE Transactions on Knowledge and Data Engineering, v.8 n.1, p.144-156, February 1996 [doi>10.1109/69.485643]
• 7: Prioritized Token-Based Mutual Exclusion for Distributed Systems, Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium, p.791, March 30-April 03, 1998
• 8: M. Naimi, M. Trehel. An improvement of the log(n) distributed algorithm for mutual exclusion. In Int. Conference on Distributed Computing Systems, 1987.
• 9: Mohamed Naimi , Michel Trehel , André Arnold, A log (N) distributed mutual exclusion algorithm based on path reversal, Journal of Parallel and Distributed Computing, v.34 n.1, p.1-13, April 10, 1996 [doi>10.1006/jpdc.1996.0041]
• 10: Kerry Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems (TOCS), v.7 n.1, p.61-77, Feb. 1989 [doi>10.1145/58564.59295]