Dijkstra, E. W. (1965, September). Solution of a problem in concurrent programming control. Communications of the ACM 8 (9), 569.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is a collection of asynchronous processes, each alternately executing a critical and a non critical section. These processes must be synchronized so that no two processes ever execute their critical sections concurrently. The mutual exclusion problem was first described and solved by Dijsktra [36]. Since mutual exclusion is an intuitive model for reasoning about concurrency, it is the most popular way to coordinate correct access to shared data and has been extensively studied over the years. Almost all formal models of concurrent processing are based on the underlying assumption of ....

Edsger W. Dijkstra. Solution of a Problem in Concurrent Programming Control. Communications of the ACM, 8(9):569, September 1965.

....shaxed memory, read modify write, conditional probability. Research supported by research contracts ONR N00014 91 J 1046, NSF CCR 8915206 and DARPA N00014 89 J 1988. re mall: saias theory.lcs.mit .edu t e mail: lynch t heory. lcs.rait.edu I Introduction The problem of mutual ezclusion [2] involves allocating .an indivisible, reusable resource among n competing processes. A mutual exclusion algorithm is said to guarantee progress if it continues to allocate the resource as long as at least one process is requesting it. It guarantees no lockout if every process that requests the ....

E. Dijkstra. Solution of a Problem in Concurrent Programming Control. Communications of the ACM, 321, (1966)

....incurs no extra overhead. The stealing stack also functions to let thieves perform the cheapest stealing operations possible. Synchronization between worker and thief has been optimized to move as much of the overhead as possible to the thief by using a Dijkstra like mutual exclusion protocol. [18, 16] The protocol is illustrated in figure 3. As long as no stealing is taking place, workers will not have to resort to an expensive lock. In addition, a worker will only need to lock if a thief is stealing at the same or higher stealing level (as defined by the stack) This prevents, for example, a ....

E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965. 6

....ouly a very weak progress requirement is made. For example, correct solutions to this problem admit executions in which a process is locked out of the critical section. 4. 2 Dijkstra s Mutual Exclusion Algorithm In this section, we model Dijkstra s shaxed memory mutual exclusion algorithm [2] as an il lustration of our shazed memory extensions to the I O automaton model. As presented here, the vaxible names and structure more closely follow the description in [6] although the algorithm is the same. We implement schedule module by a collection of n automata Pi, i I, where each Pi ....

E.W. Dijkstra. Solutions of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.

....that 2 shared states are necessary and sufficient to solve the problem of deadlock free mutual exclusion for N processes using only individual reads and writes of shared variables for communication. INTRODUCTION The first solution to the mutual exclusion problem was given in 1965 by Dijkstra [1]. The original definition of the problem requires that N processes be synchronized so that no two processes are simultaneously executing portions of their code which are called critical sections . Processes execute asynchronously; that is, they execute at independent, finite, non zero rates, ....

....In this This research was supported In part by Army Research Offlce Contract DAAG29 79 C 0155 and NSF Grants MCS77 5628 and MCS78 01689. 833 paper we examine the number of shared states required for Dijkstra s original problem. It is interesting to note that although the algorithms in papers [1 4] solve slightly different problems, they all use exactly the same number of shared states, N 3 N (one N valued variable and N three valued variables) Note: Dijkstra [1] uses N pairs of binary variables, but each pair takes on only three possible values. We will show that N binary variables ....

[Article contains additional citation context not shown here]

Dijkstra, E.W. Solution of a problem In concurrent programming control. Comm. ACM 8, 9 (Sep. 1965), 569.

....corrupted data if P W P W P W P W D W D W D W D W Writer Reader X X X X X R Max P Figure 2: Reader and writer execution timelines, and each denotes a write operation performed by the writer. the writer simultaneously writes new data. There are many synchronization based algorithms [9, 10] designed to ensure that reader tasks will always access uncorrupted messages. As mentioned earlier, synchronization, particularly with locks, can cause many problems of its own. Therefore, in this paper, we focus on wait free, singlewriter, multiple reader IPC algorithms [7, 8, 17, 24, 31] ....

E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the Association of Computing Machinery, 8(9):569, 1965.

....rather than cooperate: An operation triggered by processor p may interfere with an operation of processor q, and thus may make the work invested by q futile. Indeed, distributed counting may be seen as an evolvement of the most fundamental distributed coordination primitive, mutual exclusion [Dij65, Lam74] Whereas mutual exclusion primarily intended to accomplish correct coordination, distributed counting aims for providing fast coordination among processors. In this work, we will discuss how to model performance in distributed counting, present and analyze several interesting schemes that ....

Edsger W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.

....critical action. Thus as a practical matter the presence or absence of potential permanent blockage is not as amenable to automatic verification as some other properties of systems. 4. 7 An Example As a final unified example of all of the techniques of this chapter let us consider Dijkstra s [7] elegant solution to the mutual exclusion prob lem. This was the first satisfactory interlock protocol which involved only testing and setting variables in common store by the processes rather than a monitor, queues or static priority. For n processes the common store consists of two Boolean ....

Dijkstra E. W. Solution of a problem in concurrent programming control. Connunications of the ACM 8, 9 (September 1965) 569.

....long. The which one Thus as a practical matter the presence or absence of potential permanent blockage is not as amenable to automatic verification as some other properties of systems. 4. 7 An Exampl As a final unified example of all of the techniques of this chapter let us consider Dijkstra s [7] elegant solution to the mutual exclusion problem. This was the first satisfactory interlock protocol which involved only testing and setting variables in common store by the processes rather than a monitor queues or static priority. For n processes the common store consists of two Boolean arrays ....

Dijkstra E. W. Solution of a problem in concurrent programming control. Communications of the ACM 8, 9 (September 1965) 569.

No context found.

Dijkstra, E. W. (1965, September). Solution of a problem in concurrent programming control. Communications of the ACM 8 (9), 569.

No context found.

E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.

No context found.

E. W. Dijkstra. Solution of a Problem in Concurrent Programming Control. Comm. ACM 17, 11 (November 1974), 643-644.

No context found.

DIJKSTRA, E. W. Solution of a problem in concurrent programming control . Communications of the ACM, 8(9):569.

No context found.

E. W. Dijkstra. 1965. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September.

No context found.

E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, Sept. 1965.

No context found.

E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.

No context found.

E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.

No context found.

Edsger W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.

No context found.

E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8(9):569, September 1965.

No context found.

E. W. Dijkstra. Solution of a Problem in Concurrent Programming Control. Communication of the ACM, 8(9):569, 1965.

No context found.

E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.

No context found.

E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.

No context found.

E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9):569, Sept. 1965.

No context found.

E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9), page 569, September 1965.

No context found.

E. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC