A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
Typical shared-memory multiprocessor OS kernels use interlocking, implemented as spinlocks or waiting semaphores. We h a v e implemented a complete multiprocessor OS kernel including threads, virtual memory, and I O including a window system and a le system using only lock-free synchronization methods based on Compare-and-Swap. Lock-free synchronization avoids many serious problems caused by l o c ks: considerable overhead, concurrency bottlenecks, deadlocks, and priority i n v ersion indoi:10.1145/142111.993246 fatcat:bgw3bmlfgna77jizdemn2rrgre