SRC Research Report 7

A Fast Mutual Exclusion Algorithm.

Leslie Lamport.

A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.

Back to the SRC Research Reports main page.

• PostScript compressed with UNIX compress -- 88 Kbytes
  
• PostScript compressed with GNU compress (gzip) -- 69 Kbytes
  
• PostScript compressed with ZIP -- 69 Kbytes
  
• PostScript -- 160 Kbytes
  
• Portable Document Format (PDF) -- 128 Kbytes