Delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability

Guohong Cao, M. Singhal, Y. Deng, N. Rishe, W. Sun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay tradeoff in mutual exclusion algorithms. Lamport's algorithm and Ricart-Agrawal algorithm both have a synchronization delay of T, but their message complexity is O(N). Maekawa's algorithm reduces message complexity to O(√N); however, it increases the synchronization delay to 2T. After Maekawa's algorithm, many quorum-based mutual exclusion algorithms have been proposed to reduce message complexity or increase the resiliency to site and communication link failures. Since these algorithms are Maekawa-type algorithms, they also suffer from long synchronization delay 2T. In this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to T and still has the low message complexity O(K) (K is the size of the quorum, which can be as low as log N). A correctness proof and detailed performance analysis are provided.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
EditorsM.P. Papazoglou, M. Takizawa, B. Kramer, S. Chanson
PublisherIEEE
Pages444-451
Number of pages8
StatePublished - 1998
EventProceedings of the 1998 18th International Conference on Distributed Computing Systems - Amsterdam, Neth
Duration: May 26 1998May 29 1998

Other

OtherProceedings of the 1998 18th International Conference on Distributed Computing Systems
CityAmsterdam, Neth
Period5/26/985/29/98

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability'. Together they form a unique fingerprint.

  • Cite this

    Cao, G., Singhal, M., Deng, Y., Rishe, N., & Sun, W. (1998). Delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability. In M. P. Papazoglou, M. Takizawa, B. Kramer, & S. Chanson (Eds.), Proceedings - International Conference on Distributed Computing Systems (pp. 444-451). IEEE.