Ahuja, Bhawan and Popli, Adit and Krishna Prakasha, K and Muniyal, Balachandra (2013) Solution for Mutual Exclusion. International Journal of Application or Innovation in Engineering & Management (IJAIEM) , 2 (6). pp. 321-328. ISSN 2319 – 4847

PDF IJAIEM-2013-06-26-081.pdf - Published Version Restricted to Registered users only Download (628kB) | Request a copy

Abstract

Mutual exclusion makes sure that any given process while in its execution, trying to modify any shared resource prevents the other processes from doing the same. While one process accesses the shared resource, the other processes requiring to access the same will be kept waiting. When the process completes accessing the shared variable, among the other waiting processes, one is selected based on a certain criteria. The proposed algorithm makes sure that there is no possibility of deadlock by using time complexity and a newly defined parameter-timeout. In case of abrupt termination of the process due to unexpected system failure, the recent safe state will be restored. The proposed algorithm ensures that at any given time, shared resource never reaches any inconsistent state

Item Type:	Article
Uncontrolled Keywords:	Time Complexity, Aging, Mutual Exclusion, Critical Section, Starvation
Subjects:	Engineering > MIT Manipal > Information and Communication Technology
Depositing User:	MIT Library
Date Deposited:	21 Feb 2015 09:16
Last Modified:	21 Feb 2015 09:16
URI:	http://eprints.manipal.edu/id/eprint/142008

Actions (login required)

View Item