An efficient distributed mutual exclusion algorithm based on relative consensus voting

2003-2004 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Exploiting replication in distributed systems

Techniques are examined for replicating data and execution in directly distributed systems: systems in which multiple processes interact directly with one another while continuously respecting constraints on their joint behavior. Directly distributed systems are often required to solve difficult problems, ranging from management of replicated data to dynamic reconfiguration in response to failures. It is shown that these problems reduce to more primitive, order-based consistency problems, which can be solved using primitives such as the reliable broadcast protocols. Moreover, given a system that implements reliable broadcast primitives, a flexible set of high-level tools can be provided for building a wide variety of directly distributed application programs

Performance evaluation of distributed mutual exclusion algorithms

In any system in which concurrent processes share resources, mutual exclusion refers to the problem of guaranteeing the integrity of those resources by restricting their use to one process at a time. Due the complex nature of distributed systems, distributed mutual exclusion algorithms are often not amenable to theoretical analysis for performance or even correctness. Experimental inquiries are therefore warranted. This thesis investigates seven well known distributed mutual exclusion algorithms in detail, and uses computer simulation to evaluate the performance and applicability of these various algorithms. Toward this end, a realistic and general model for evaluating distributed algorithms is proposed. Results of the experiments include the discovery of starvation and deadlock problems in two algorithms, the identification of one algorithm as the best performer in a general network in which sites do not fail, and experimental performance analysis of one algorithm which accommodates site failures

Data handover on a peer-to-peer system

This paper presents the DHO API and its integration into apeer-to-peer Grid architecture. It provides an efficientmanagement of critical data resources in an extensible distributedsetting consisting of a set of peers that may join or leave the system.Locking and mapping of such a resource are handled transparently forusers: they may access them through simple function calls.On the lowest level of the proposed architecture the Exclusive Locksfor Mobile Processes ELMP algorithm ensures data consistencyand guarantees the logical order of requests.All operations in our architecture have an amortized cost of O(logn). An experimental assessment validates the practicality of ourproposal

Transparent distributed data management in large scale distributed systems

International audienceIn this chapter, we deal with sharing resources transparency in large distributed systems. By using the Data Handover (DHO), together with a peer-to-peer system we provide an easy-to-use architecture to claim resources in dynamic environments: data resources are distributed over a set of peers that may appear and disappear. By means of DHO functions, users request the mapping of data into local memory (for reading or writing) without prior knowledge neither of the location of that data nor of the underlying structure nor of the mobility of peers. This abstraction level is ensured by three managers that interact within our three level architecture. Two algorithms, Exclusive Locks with Mobile Processes (ELMP) and Read-Write Locks with Mobile Processes (RW-LMP), are introduced on the lowest level of the architecture. They ensure data access consistency despite the dynamicity of the environment. Both algorithms satisfy Safety and Liveness properties. Experimental studies show good performance as well as the stability of our approach

Graphical Simulation Tool from Logical Token-based Distributed Mutual Exclusion Algorithms�

Computer Science

The Problem of Mutual Exclusion: A New Distributed Solution

In both centralized and distributed systems, processes cooperate and compete with each other to access the system resources. Some of these resources must be used exclusively. It is then required that only one process access the shared resource at a given time. This is referred to as the problem of mutual exclusion. Several synchronization mechanisms have been proposed to solve this problem. In this thesis, an effort has been made to compile most of the existing mutual exclusion solutions for both shared memory and message-passing based systems. A new distributed algorithm, which uses a dynamic information structure, is presented to solve the problem of mutual exclusion. It is proved to be free from both deadlock and starvation. This solution is shown to be economical in terms of the number of message exchanges required per critical section execution. Procedures for recovery from both site and link failures are also given

Interprocess communication in highly distributed systems

Issued as Final technical report, Project no. G-36-632Final technical report has title: Interprocess communication in highly distributed system