An efficient solution to the critical section problem Conference

Makki, K, Pissinou, N, Park, EK. (1994). An efficient solution to the critical section problem . 2013 42ND ANNUAL INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2 II77-II80. 10.1109/ICPP.1994.53

cited authors

  • Makki, K; Pissinou, N; Park, EK

authors

abstract

  • In a distributed system of N sites an efficient solution to the critical section problem is proposed to allow multiple simultaneous entries to the Critical Section. The proposed solution is token-based, deadlock-free and free from starvation. In all cases except during the book keeping cycle of the algorithm, the number of message exchanges per Critical Section execution is less than or equal to 5. Only during the book keeping cycle which is not done very often the number of message exchanges per Critical Section execution reaches to at most N. © 1994 IEEE.

publication date

  • January 1, 1994

published in

Digital Object Identifier (DOI)

start page

  • II77

end page

  • II80

volume

  • 2