Distributed Mutual Exclusion Based on Causal Ordering
نویسندگان
چکیده
منابع مشابه
Distributed Mutual Exclusion Based on Causal Ordering
Problem statement: Causality among events, more formally the causal ordering relation, is a powerful tool for analyzing and drawing inferences about distributed systems. The knowledge of the causal ordering relation between processes helps designers and the system itself solve a variety of problems in distributed systems. In distributed algorithms design, such knowledge helped ensure fairness a...
متن کاملBackoff Protocols for Distributed Mutual Exclusion and Ordering
We present a simple and efficient protocol for mutual exclusion in synchronous, message-passing distributed systems subject to failures. Our protocol borrows design principles from prior work in backoff protocols for multiple access channels such as Ethernet. Our protocol is adaptive in that the expected amortized system response time— informally, the average time a process waits before enterin...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Theory for Composing Distributed Components, Based on Mutual Exclusion
Compositionality provides the foundation of software modularity, reusability and separate verification of software components. One of the known difficulties, when separately verifying components, is producing compositional proofs for progress properties of distributed systems. This paper presents a new composition theory based on reasoning about temporary interference. The approach is axiomatic...
متن کاملA Simulation Study on Distributed Mutual Exclusion
In the problem of mutual exclusion concurrent access to a shared resource using a struc tural program abstraction called a Critical Section CS must be synchronized such that at any time only one process can enter the CS In a distributed system due to the lack of both a shared memory and a global clock and due to unpredictable message delay the design of a distributed mutual exclusion algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2009
ISSN: 1549-3636
DOI: 10.3844/jcssp.2009.398.404