Name
Abstract | ||
|---|---|---|
utual exclusion: memoryoperations act as if all those in one critical section were performed either beforeor after all those in another. Virtual mutual exclusion says nothing about whenthe operations are really performed.As an example, consider the following basic mutual exclusion protocol thatis used by several standard algorithms.Processor A: a : = 1; if b = 0 then critical section; a : = 0 f iProcessor B : b : = 1; if a = 0 then critical section; b : = 0 f i1Suppose neither of... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0020-0190(00)00132-0 | Inf. Process. Lett. |
Keywords | Field | DocType |
guarantee mutal exclusion,correct mutual exclusion algorithm,synchronization,mutual exclusion,concurrency,shared memory,critical section | Sequential consistency,Shared memory,Concurrency,Computer science,Critical section,Algorithm,Look-ahead,Multiprocessing,Mutual exclusion,Dijkstra's algorithm | Journal |
Volume | Issue | ISSN |
76 | 3 | 0020-0190 |
Citations | PageRank | References |
2 | 0.39 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leslie Lamport | 1 | 2 | 0.39 |
| Sharon Perl | 2 | 2 | 0.39 |
| William E. Weihl | 3 | 2614 | 903.11 |