A model for an expert system for medium access control in a local area network
Information Sciences: an International Journal - Special issue on expert systems
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
File access performance of diskless workstations
ACM Transactions on Computer Systems (TOCS)
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Motivations, Objectives and Characterization of Distributed Systems
Distributed Systems - Architecture and Implementation, An Advanced Course
Process structuring, synchronization, and recovery using atomic actions
Proceedings of an ACM conference on Language design for reliable software
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms
IEEE Transactions on Parallel and Distributed Systems
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols
IEEE Transactions on Software Engineering
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion
ACM SIGOPS Operating Systems Review
A Fair Distributed Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
A distributed mutual exclusion solution derived from real-life examples
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Flexible synchronization of shared groupware objects
ACM SIGGROUP Bulletin
A Resilient Mutual Exclusion Algorithm for Computer Networks
IEEE Transactions on Parallel and Distributed Systems
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A heuristic approach to resource locations in broadband networks
Journal of Network and Computer Applications
Fault-Tolerance for Token-based Synchronization Protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Mobile Agent Enabled Fully Distributed Mutual Exclusion Algorithm
MA '02 Proceedings of the 6th International Conference on Mobile Agents
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Scalable Distributed Concurrency Services for Hierarchical Locking
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview
ACM SIGOPS Operating Systems Review
Scalable hierarchical locking for distributed systems
Journal of Parallel and Distributed Computing - Special issue on middleware
A new robust centralized DMX algorithm
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Weakest precondition based verification tool that models spatial ordering
ACM SIGSOFT Software Engineering Notes
A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks
International Journal of Parallel, Emergent and Distributed Systems
A dual-token-based fault tolerant mutual exclusion algorithm for MANETs
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Modified raymond's algorithm for priority (MRA-P) based mutual exclusion in distributed systems
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
A low-overhead dedicated execution support for stream applications on shared-memory cmp
Proceedings of the tenth ACM international conference on Embedded software
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Journal of Network and Systems Management
| Hi-index | 14.99 |
A heuristically-aided algorithm to achieve mutual exclusion in distributed systems is presented which has better performance characteristics than previously proposed algorithms. The algorithm makes use of state information, which is defined as the set of states of mutual exclusion processes in the system. Each site maintains information about the state of other sites and uses it to deduce a subset of sites likely to have the token. Consequently, the number of messages exchanged for a critical section invocation is a random variable between 0 and n (n is the number of sites in the system). It is shown that the algorithm achieves mutual exclusion and is free from deadlock and starvation. The effects of a site crash are discussed, as are those of a communication-medium failure on the proposed algorithm. Methods of recovery from these failures are suggested. The performance of the algorithm is studied using a simulation technique (and an analytic technique for low and heavy traffics of requests for critical section execution).