JDM: BUILDING DISTRIBUTED SYNCHRONIZATION SUPPORT INTO JAVA

2001 ◽  
Vol 02 (03) ◽  
pp. 269-282
Author(s):  
JIANNONG CAO ◽  
NICK K. C. CHEUNG ◽  
ALVIN CHAN
Keyword(s):  
System Architecture ◽  
Large Scale ◽  
Mutual Exclusion ◽  
Distributed Programming ◽  
Shared Resources ◽  
Object Oriented Design ◽  
Distributed Synchronization ◽  
High Level ◽  
Distributed Mutual Exclusion ◽  
Mutual Exclusion Algorithm

The monitor concept has been widely used in a concurrent programming environment for implicitly ensuring mutual exclusion and explicitly achieving process synchronization. It has also been extended to support high-level distributed programming. In this paper, we present JDM, a distributed monitor construct in Java for programming large-scale distributed systems. The distributed monitor construct is based on a well-know tree-based distributed mutual exclusion algorithm proposed by K. Raymond. To increase scalability of the construct, a two-level system architecture is developed, where the node level controls the access to the system-wide shared resources using Raymond's algorithm and the process level synchronizes local processes based on the local monitor concept. An object-oriented design of the system architecture is presented. Implementation and results of performance evaluation are reported and factors that influence the performance of the construct are discussed.

Token Based Mutual Exclusion in Peer-to-Peer Systems

2012 ◽  
pp. 214-228 ◽  
Author(s):  
Mayank Singh ◽  
Shashikala Tapaswi
Keyword(s):  
Distributed Systems ◽  
Message Passing ◽  
Mutual Exclusion ◽  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Shared Resources ◽  
Peer To Peer Systems ◽  
Mutual Exclusion Algorithm ◽  
Message Overhead

Mutual exclusion is one of the well-studied fundamental primitives in distributed systems, and a number of vital solutions have been proposed to achieve the same. However, the emerging Peer to Peer systems bring forward several challenges to protect consistent and concurrent access to shared resources, as classical peer-to-peer systems, like Napster, Gnutella, et cetera, have been mainly used for sharing files with read only permission. In this chapter, the authors propose a quorum based mutual exclusion algorithm that can be used over any Peer to Peer Distributed Hash Table (DHT). The proposed approach can be seen as extension to traditional Sigma protocol for mutual exclusion in Peer to Peer systems. The basic idea is to reduce message overhead with use of smart nodes present in each quorum set and message passing between the current owners of resource with next resource requester nodes.

Sign in / Sign up

Export Citation Format

Share Document