Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Software (D) > Operating Systems (D.4) > Process Management (D.4.1) > Mutual Exclusion (D.4.1...)  
 
Options:
 
  1-10 of 18 Reviews about "Mutual Exclusion (D.4.1...)": Date Reviewed
  Note: an efficient distributed token-based mutual exclusion algorithm with central coordinator
Wu M., Shu W. Journal of Parallel and Distributed Computing 62(10): 1602-1613, 2002.  Type: Article

Consider a distributed system, consisting of N connected nodes, with no shared memory, that communicates by message passing. Many mutual-exclusion algorithms exist to coordinate the resource sharing of objects by these N ...

May 15 2003
  A hybrid distributed mutual exclusion algorithm
Chang Y. Microprocessing and Microprogramming 41(10): 715-731, 1996.  Type: Article

The existing mutual exclusion algorithms in distributed systems can be categorized as token-based or non-token-based. Some of these algorithms focus on reducing message traffic, others on minimizing time delay. However, there is no sin...

Oct 1 1997
  Trapping mutual exclusion in the box calculus
Esparza J., Bruns G. Theoretical Computer Science 153(1-2): 95-128, 1996.  Type: Article

Box calculus is a new process algebra that seems to have a relatively simple Petri net semantics. The purpose of this new algebra is to be able to translate real-life parallel programs into a set of algebraic rules and then to prove in...

Jul 1 1997
  A bounded first-in, first-enabled solution to the l-exclusion problem
Afek Y., Dolev D., Gafni E., Merritt M., Shavit N. ACM Transactions on Programming Languages and Systems 16(3): 939-953, 1994.  Type: Article

Consider a system consisting of n processes, where each process has a segment of code called a critical section. The important feature of the system is that, when one process is executing in its critical section, no ...

Oct 1 1995
  Implementing multiple locks using Lamport’s mutual exclusion algorithm
Boehm H., Demers A., Uhler C. ACM Letters on Programming Languages and Systems 2(1-4): 46-58, 1993.  Type: Article

The implementation of spin locks using Lamport’s fast algorithm for mutual exclusion [1] is described. A straightforward implementation of Lamport’s algorithm would replicate all of its variables, including the Bool...

May 1 1995
  Improving fast mutual exclusion
Styer E.  Principles of distributed computing (, Vancouver, B.C., Canada, Aug 10-12, 1992) 1681992.  Type: Proceedings

Styer presents an algorithm to improve the performance of mutual exclusion when there are many contenders for the resource. He proves that the algorithm takes O ( t k l ) operations, where n = k l...

Nov 1 1993
  A first-come-first-served mutual-exclusion algorithm with small communication variables
Lycklama E., Hadzilacos V. ACM Transactions on Programming Languages and Systems 13(4): 558-576, 1991.  Type: Article

The algorithm for the mutual-exclusion problem discussed in this paper satisfies the first-come-first-served property. Five shared bits per process are required to implement the algorithm. The authors claim that this algorithm is the f...

Sep 1 1992
  An efficient and fault-tolerant solution for distributed mutual exclusion
Agrawal D., El Abbadi A. ACM Transactions on Computer Systems 9(1): 1-20, 1991.  Type: Article

The authors have developed a novel technique for achieving mutual exclusion in distributed systems. They provide sufficient background to make the paper accessible to readers not familiar with previous work in the area. The novelty of ...

Jul 1 1992
  A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
Singhal M. IEEE Transactions on Computers 38(5): 651-662, 1989.  Type: Article

This paper presents an algorithm with which to achieve mutual exclusion in distributed systems, which the author claims has better performance characteristics than the algorithm of Suzuki and Kasami [1]. The algorithm uses state inform...

Mar 1 1990
  The solution of mutual exclusion problems which can be described graphically
Page I., Jacob R. The Computer Journal 32(1): 45-54, 1989.  Type: Article

In this paper, the authors describe a way of solving (i.e., implementing) mutual exclusion problems that can be represented as undirected graphs. As the authors point out, their approach to mutual exclusion problems is not an attempt t...

Jan 1 1990
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy