A New Solution of Dijkstra's Concurrent Programming Problem

A simple solution to the mutual exclusion problem
is presented which allows the system to continue 
to operate despite the failure of any individual component.

CACM August, 1974

Lamport, L.

critical section, concurrent programming, multiprocessing, semaphores

4.32

CA740806 JB January 17, 1978  9:48 AM

1781	4	2618
1828	4	2618
1854	4	2618
1877	4	2618
1960	4	2618
2150	4	2618
2150	4	2618
2150	4	2618
2228	4	2618
2228	4	2618
2256	4	2618
2256	4	2618
2317	4	2618
2317	4	2618
2319	4	2618
2377	4	2618
2342	4	2618
2342	4	2618
2342	4	2618
2376	4	2618
2376	4	2618
2379	4	2618
2424	4	2618
2482	4	2618
2618	4	2618
2618	4	2618
2618	4	2618
2618	4	2618
2632	4	2618
2704	4	2618
2723	4	2618
2738	4	2618
2740	4	2618
2741	4	2618
2867	4	2618
3184	4	2618
3184	4	2618
1198	5	2618
1338	5	2618
1749	5	2618
2256	5	2618
2618	5	2618
2618	5	2618
2618	5	2618
2895	5	2618
2150	6	2618
2618	6	2618