Journal of Computer Science

Towards an Exclusion Mutual Tolerant Algorithm to Failures

M. Senouci, A. Liazid and D. Benhamamouch

DOI : 10.3844/jcssp.2007.43.46

Journal of Computer Science

Volume 3, Issue 1

Pages 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.

Copyright

© 2007 M. Senouci, A. Liazid and D. Benhamamouch. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.