Cheap Mutual Exclusion
نویسندگان
چکیده
A new method of enforcing mutual exclusion among concurrent processes on uniprocessors running UNIX is presented in this paper. When a process attempts to obtain a lock, no race condition will occur unless the process is preempted. The central idea is that a process can avoid a race condition if preemption is made visible to the process when it is rescheduled. Two possible implementations of this idea are discussed in depth. The proposed solutions do not require special hardware support or disabling of interrupts during a critical section.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملOn Transactional Memory, Spinlocks, and Database Transactions
Currently, hardware trends include a move toward multicore processors, cheap and persistent variants of memory, and even sophisticated hardware support for mutual exclusion in the form of transactional memory. These trends, coupled with a growing desire for extremely high performance on short database transactions, raise the question of whether the hardware primitives developed for mutual exclu...
متن کاملThe Prioritized and Distributed Synchronization in Distributed Groups
A simple and cheap algorithm is presented to allow prioritized mutual exclusion. There are several groups. All the members of a same group have the same level priority. Our algorithm is a token-based algorithm. Each group of participants (site) is represented by a tree structure. Inside a group, the requests are recorded in a global queue which circulates simultaneously and together with the to...
متن کاملPredicting the performance of general task
The Glamis methodology provides a framework for performance modelling of parallel applications, based on a combination of task graph models and queueing network models. This paper presents a new, moderately cheap algorithm which enables the analysis of arbitrary task graph models of parallel programs with general precedence relationships, given a queueing model of the underlying machine. The al...
متن کاملWhen does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کامل