The program that manages every other program.
11 topics · 14 curated works
No prior grounding assumed.
Misconceptions About Real-Time Computing: A Serious Problem for Next-Generation Systems
John A. Stankovic · 1988
Corrects widespread misunderstandings of real-time computing, arguing it is defined by the need to meet deadlines rather than by raw speed, and that…
Assumes you know the vocabulary.
Operating Systems: Three Easy Pieces
Remzi & Andrea Arpaci-Dusseau · 2014
Reduces the whole subject to virtualisation, concurrency and persistence, which is the right decomposition and free to read.
+5 more at this level
Primary sources and full treatments.
Cooperating Sequential Processes
Edsger W. Dijkstra · 1968
Introduces the semaphore as a general synchronisation primitive and shows how cooperating sequential processes can be composed correctly from…
+6 more at this level
12 of 14 works
John A. Stankovic
Corrects widespread misunderstandings of real-time computing, arguing it is defined by the need to meet deadlines rather than by raw speed, and that treating it as merely fast computing leads to unreliable system designs.
Remzi & Andrea Arpaci-Dusseau
Reduces the whole subject to virtualisation, concurrency and persistence, which is the right decomposition and free to read.
link checked 17 Sept 2026Fernando J. Corbato, Marjorie Merwin-Daggett & Robert C. Daley
Describes CTSS, one of the first working time-sharing systems, and the scheduling and swapping mechanisms that let dozens of users share one machine while each perceived it as their own.
Edward G. Coffman Jr., M. J. Elphick & Arie Shoshani
Formalises the four necessary conditions for deadlock, mutual exclusion, hold-and-wait, no preemption and circular wait, and surveys prevention, avoidance and detection strategies built around breaking one of them.
Dennis M. Ritchie
Traces the internal design decisions that shaped Unix between 1969 and the early 1980s, arguing the system's coherence came from a small number of ideas, the file, the process, the pipe, applied uniformly rather than from any master plan.
John Ousterhout
Argues that shared-memory concurrency makes threaded programs unnecessarily hard to write correctly for most applications, and that event-driven designs reach the same goals more safely.
Peter J. Denning
Revisits virtual memory from the engineer who formalised the working-set model, tracing it from its original role solving memory-overlay problems to its modern role protecting and sharing objects across processes.
Edsger W. Dijkstra
Introduces the semaphore as a general synchronisation primitive and shows how cooperating sequential processes can be composed correctly from processes that would otherwise interfere with each other.
Gerald J. Popek & Robert P. Goldberg
Derives precise conditions an instruction set architecture must satisfy for efficient virtualisation to be possible at all, explaining why some processors of the era could be cleanly virtualised and others could not.
Marshall K. McKusick, William N. Joy, Samuel J. Leffler & Robert S. Fabry
Redesigns UNIX file layout around cylinder groups and larger blocks, and explains why disk locality dominates file system design.
link checked 17 Sept 2026Mendel Rosenblum & John K. Ousterhout
Proposes writing all file system modifications sequentially to a log rather than updating data in place, arguing this exploits growing memory for caching and rising disk bandwidth far better than traditional file systems do.
Carl A. Waldspurger & William E. Weihl
Allocates CPU by holding a lottery over tickets, making proportional sharing simple to reason about and implement.
link checked 17 Sept 2026