Academic Journals Database
Disseminating quality controlled scientific knowledge

SURVEY OF MUTUAL EXCLUSION ALGORITHMS

ADD TO MY LIST
 
Author(s): Hossein Nick Khah | Faroukh Koroupi | Arash Azizi Mazrae

Journal: International Journal of Computer & Electronics Research
ISSN 2320-9348

Volume: 2;
Issue: 5;
Start page: 661;
Date: 2013;
Original page

Keywords: Centralized algorithm | distributed system | distributive algorithm | mutual exclusion | token ring algorithm

ABSTRACT
Distributed systems are composed of several computers connected together to share software and hardware resources are shared. Obviously, the interaction process is resource sharing. Resources where they are likely to interfere with a process called the critical region. Mutual exclusion algorithms have been proposed to manage the crisis. Mutual exclusion algorithms, the critical areas are divided between processes so that at any time only one process can enter the critical region. The rest must wait for the process to be critical. The algorithm for the selection process will be critical to the choice of a particular policy. In this paper, we have several mutual exclusion algorithms and compare the advantages and disadvantages of each method will be mentioned. The purpose of this paper is to identify areas of mutual exclusion algorithms that are critically important in today's distributed systems.
Why do you need a reservation system?      Affiliate Program