Modern Operating Systems¶
Tanenbaum, A. S., & Bos, H. (2014). Modern Operating Systems. Pearson.
Cited by¶
13 citations across 13 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Allocation
- The structural prime is identical; the criteria range from FIFO to priority to fairness-weighted, a taxonomy Tanenbaum and Bos (2014) lay out across the modern-OS treatment of process and memory schedulers.
This sourceStandard operating-systems textbook developing process scheduling and memory/resource allocation; lays out the range of scheduling criteria from FIFO to priority to fairness-weighted. SUPPORTS the claim that Tanenbaum and Bos lay out the taxonomy of process and memory schedulers.
- The structural prime is identical; the criteria range from FIFO to priority to fairness-weighted, a taxonomy Tanenbaum and Bos (2014) lay out across the modern-OS treatment of process and memory schedulers.
- Attention
- Computer science & software engineering (Tanenbaum & Bos 2014): task scheduling, interrupt handling, event-driven systems, cache coherence (memory attention), resource allocation in operating systems.
This sourceStandard OS text developing process scheduling, interrupt handling, and event-driven I/O as the OS-level analogue of attentional gating.
- Computer science & software engineering (Tanenbaum & Bos 2014): task scheduling, interrupt handling, event-driven systems, cache coherence (memory attention), resource allocation in operating systems.
- Bootstrapping
- The self-referential lift is the heart of the sequence: the firmware loads a small boot sector from disk; that boot sector, now running, loads a larger second-stage boot loader; that loader, using capabilities the prior stage put in place, loads and decompresses the kernel; the kernel then initializes drivers and mounts the filesystem that finally lets the full OS run.
This sourceDescribes the staged boot chain — firmware/BIOS loads a small boot sector, which loads a larger second-stage loader, which loads and decompresses the kernel, which initializes drivers and mounts the filesystem — each stage operating only because the prior stage built it.
- The self-referential lift is the heart of the sequence: the firmware loads a small boot sector from disk; that boot sector, now running, loads a larger second-stage boot loader; that loader, using capabilities the prior stage put in place, loads and decompresses the kernel; the kernel then initializes drivers and mounts the filesystem that finally lets the full OS run.
- Ecotone
- In interface design, the region where two systems blend — kernel and user space, hardware and software, application and operating system — hosts characteristic problems (security boundaries, performance bottlenecks, debugging difficulty) that are properties of the zone, not of either regime.
This sourceDescribes the kernel/user-space boundary and its characteristic zone-specific problems (security boundaries, performance, debugging difficulty).
- In interface design, the region where two systems blend — kernel and user space, hardware and software, application and operating system — hosts characteristic problems (security boundaries, performance bottlenecks, debugging difficulty) that are properties of the zone, not of either regime.
- Incomplete Contract
- The combinatorial blow-up of contingency enumeration is absorbed by delegating to a process or a person who handles the open set at runtime — the same complexity-management move that virtual memory makes for address spaces, that exception handling makes for control flow, and that constitutional vagueness makes for legislation: trade exhaustive enumeration for principled delegation.
This sourceVirtual memory and exception handling as the complexity-management move of trading exhaustive enumeration for principled runtime delegation — the computational analogue of gap-filling.
- The combinatorial blow-up of contingency enumeration is absorbed by delegating to a process or a person who handles the open set at runtime — the same complexity-management move that virtual memory makes for address spaces, that exception handling makes for control flow, and that constitutional vagueness makes for legislation: trade exhaustive enumeration for principled delegation.
- Inhibition
- In software and concurrency mutex locks, semaphores, rate limiters, and circuit breakers block a transformation from proceeding while a condition holds.
This sourceStandard text covering mutual exclusion (mutexes, semaphores) blocking a process from proceeding while a condition holds.
- In software and concurrency mutex locks, semaphores, rate limiters, and circuit breakers block a transformation from proceeding while a condition holds.
- Livelock
- Distributed systems — the origin: polite-yield deadlock variants, collision-and-backoff schemes before exponential backoff, retry storms, thundering-herd patterns, and sustained contention with yielding.
This sourceDefines livelock as distinct from deadlock — processes remaining active and responsive yet making no progress (Sec. 6.5) — in the deadlock chapter.
- Distributed systems — the origin: polite-yield deadlock variants, collision-and-backoff schemes before exponential backoff, retry storms, thundering-herd patterns, and sustained contention with yielding.
- Message Passing
- Operating systems — inter-process communication via pipes, sockets, signals, and message queues; the microkernel's commitment to messaging over shared address space.
This sourceCovers inter-process communication (pipes, sockets, signals, message queues), the send/receive primitives, lost/duplicate-message handling, and the microkernel's commitment to messaging over a shared address space.
- Operating systems — inter-process communication via pipes, sockets, signals, and message queues; the microkernel's commitment to messaging over shared address space.
- Race Condition
- Record-Reality Divergence
- The essential insight is a cache-coherence framing: every authoritative record of an external state is a cache, and every cache requires invalidation.
This sourceTreats caching, cache invalidation, write-through versus write-back, time-to-live, and freshness as the general discipline of keeping a cached record coherent with its source.
- The essential insight is a cache-coherence framing: every authoritative record of an external state is a cache, and every cache requires invalidation.
- Resource Management
- Tanenbaum and Bos (2014) catalog these primitives as the standard mechanisms operating systems expose for managing CPU, memory, I/O, and process-level resource ceilings.
This sourceStandard operating-systems textbook: develops process scheduling, interrupt handling, event-driven I/O, and resource allocation as the OS-level analogue of attentional gating across competing computational demands.
- Tanenbaum and Bos (2014) catalog these primitives as the standard mechanisms operating systems expose for managing CPU, memory, I/O, and process-level resource ceilings.
- Starvation
- Networks and databases — low-priority packets perpetually deferred under unfair queuing; a long transaction repeatedly aborted by short ones in a contention loop.
This sourceTreats starvation in scheduling, the readers–writers problem, and unfair queuing where a low-priority party is perpetually deferred.
- Networks and databases — low-priority packets perpetually deferred under unfair queuing; a long transaction repeatedly aborted by short ones in a contention loop.
Domain-specific¶
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 13 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:d8d51c9c0a1e · see in the full table