Research Article Open Access

Towards an Exclusion Mutual Tolerant Algorithm to Failures

M. Senouci1, A. Liazid1 and D. Benhamamouch1
  • 1 ,
Journal of Computer Science
Volume 3 No. 1, 2007, 43-46

DOI: https://doi.org/10.3844/jcssp.2007.43.46

Submitted On: 18 September 2006 Published On: 31 January 2007

How to Cite: Senouci, M., Liazid, A. & Benhamamouch, D. (2007). Towards an Exclusion Mutual Tolerant Algorithm to Failures. Journal of Computer Science, 3(1), 43-46. https://doi.org/10.3844/jcssp.2007.43.46

Abstract

The distributed algorithmic is widely used in various economic and industrial fields as finance, medical, industry, telecommunication. New technologies are increasing rapidly. From now on, applications must associate two conditions: auto-execution on heterogeneous grid computers, on the one hand and on the other hand, satisfaction of the temporal and safety constraints. Hence this paper deals with performing an algorithm based on an innovative idea based on the mutual exclusion which permits to adjust the access conflict to the shared resources and to synchronize sites in a distributed system. The performed algorithm was tolerant to breakdowns. A site wanting to enter in critical section demands the permission of all sites of it set called quorum. This quorum notion assures the mutual exclusion even in the case of breakdowns. The presented algorithm was exempt of deadlock and assures the equity.

  • 1,129 Views
  • 1,455 Downloads
  • 3 Citations

Download

Keywords

  • Mutual exclusion
  • distributed system
  • logic arborescence
  • quorum