Mutex
Operating System
Abstract
This paper problem and solution comparison is based on two journal paper in the area of computer science. The topic is about the problem of mutual-exclusion and the solutions given by Leslie Lamport and Gary L. Peterson.
1. Introduction
Leslie Lamport are responsible for many ground breaking result so mutual exclusion problem. Lamport was the first to notice the circular reasoning inherent in shared memory mutual exclusion algorithms that require atomic instruction. He shows that atomic reads and writes can be implemented from non-atomic reads and writes without mutual exclusion. Lamport also initiated the study of mutual exclusion algorithm that “fast” in the action of contention. He is also responsible for the first fully distributed solution for the mutual exclusion problem. The algorithm he used presented is a paper that also introduces logical clocks and state machines. Gary L. Peterson introduce the algorithm that much simpler than other algorithm.
2. Problem statement
Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by asynchronous, concurrent processes. A process accesses the resource to be managed by executing a “critical section” of code. Before and after executing its critical section, a process executes two other code fragments, called “entry" and “exit" sections, respectively. A process may stop within its non-critical section but not within its critical section. The objective is to design the entry and exit sections so that the following requirements hold. Exclusion; at most one process executes its critical section at any time. Starvation-freedom; if some process is in its entry section, then that process eventually executes its critical section.
3. Method used to solve problem
3.1 Leslie Lamport have introduces many works on mutual exclusion and has focused on “user-level” algorithm for shared memory based on either atomic or non-atomic reads or writes. He has
Abstract
This paper problem and solution comparison is based on two journal paper in the area of computer science. The topic is about the problem of mutual-exclusion and the solutions given by Leslie Lamport and Gary L. Peterson.
1. Introduction
Leslie Lamport are responsible for many ground breaking result so mutual exclusion problem. Lamport was the first to notice the circular reasoning inherent in shared memory mutual exclusion algorithms that require atomic instruction. He shows that atomic reads and writes can be implemented from non-atomic reads and writes without mutual exclusion. Lamport also initiated the study of mutual exclusion algorithm that “fast” in the action of contention. He is also responsible for the first fully distributed solution for the mutual exclusion problem. The algorithm he used presented is a paper that also introduces logical clocks and state machines. Gary L. Peterson introduce the algorithm that much simpler than other algorithm.
2. Problem statement
Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by asynchronous, concurrent processes. A process accesses the resource to be managed by executing a “critical section” of code. Before and after executing its critical section, a process executes two other code fragments, called “entry" and “exit" sections, respectively. A process may stop within its non-critical section but not within its critical section. The objective is to design the entry and exit sections so that the following requirements hold. Exclusion; at most one process executes its critical section at any time. Starvation-freedom; if some process is in its entry section, then that process eventually executes its critical section.
3. Method used to solve problem
3.1 Leslie Lamport have introduces many works on mutual exclusion and has focused on “user-level” algorithm for shared memory based on either atomic or non-atomic reads or writes. He has
References: [1] L. Lamport. A new solution of Dijkstra 's concurrent programming problem. Communications of the ACM, 17(8) pp. 453-455, August 1974 [2] Gary L. Peterson. Myths About The Mutual Exclusion Problem. Information Processing Letters. Vol. 12, number 3, pp. 115-116