论文信息 - A Lock-Free Multiprocessor OS Kernel

A Lock-Free Multiprocessor OS Kernel

Typical shared-memory multiprocessor OS kernels use interlocking, implemented as spin-locks or waiting semaphores. We have implemented a complete multiprocessor OS kernel, including threads, virtual memory, and I/O (including a window system and a file system), using only lockfree synchronization methods based on Compare-and-Swap. Lock-free synchronization avoids many serious problems caused by locks: considerable overhead, concurrency bottlenecks, deadlocks, and priority inversion in real-time scheduling. Measurements show the low overhead of our implementation, competitive with user-level thread management systems.

Calton Pu | Henry Massalin | C. Pu | H. Massalin

[1] Calton Pu,et al. The Synthesis Kernel , 1988, Comput. Syst..

[2] Allan Gottlieb,et al. Operating system data structures for shared memory mimd machines with fetch-and-add , 1988 .

[3] S. F. Flynn-Hummel. SMARTS: Shared Memory Multiprocessor Ada Run Time Supervisor , 1989 .

[4] Calton Pu,et al. Fine-Grain Adaptive Scheduling using Feedback , 1989, Comput. Syst..

[5] Evangelos P. Markatos,et al. Implementation Issues for the Psyche Multiprocessor Operating System , 1989, Comput. Syst..

[6] Calton Pu,et al. Threads and input/output in the synthesis kernal , 1989, SOSP '89.

[7] THOMAS J. LEBLANC,et al. The Elmwood multiprocessor operating system , 1989, Softw. Pract. Exp..

[8] Thomas E. Anderson,et al. The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..

[9] David L. Black. Scheduling support for concurrency and parallelism in the Mach operating system , 1990, Computer.

[10] Edith Schonberg,et al. Low-overhead scheduling of nested parallelism , 1991, IBM J. Res. Dev..

[11] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.

[12] Brian N. Bershad,et al. Scheduler activations: effective kernel support for the user-level management of parallelism , 1991, TOCS.