Operating System Concepts¶
Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating System Concepts. Wiley.
Cited by¶
12 citations across 12 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Goal Shielding
- Map the roles: the active element holding resources is the thread inside the critical section, holding the mutex (the scarce resource); the competitor set under inhibition is every other runnable thread that needs that mutex, blocked at the lock; the activation-contingent suppression mechanism is the mutex itself, which holds the competitors out exactly as long as the active thread retains the lock; the switching condition is
unlock(), which releases the suppression; and the release rebound is the wakeup storm of contending threads that surge in once the lock frees.This sourceEstablishes the semaphore/lock wait-queue and block/wakeup model; releasing a contended lock wakes blocked processes from the queue, producing the wakeup/thundering-herd surge of contending threads when suppression lifts.
- Map the roles: the active element holding resources is the thread inside the critical section, holding the mutex (the scarce resource); the competitor set under inhibition is every other runnable thread that needs that mutex, blocked at the lock; the activation-contingent suppression mechanism is the mutex itself, which holds the competitors out exactly as long as the active thread retains the lock; the switching condition is
- Interleaving
- The benefit is strongest precisely when the types are confusable, since interleaving builds the discrimination that blocking lets the learner skip. Computer science: Instruction interleaving, multithreading, and time-slicing alternate work units on a shared processor to hide latency — while one thread waits on memory or I/O, another runs — and to share a scarce execution resource fairly among competing tasks.
This sourceStandard OS text: CPU scheduling time-slices one processor among many processes via brief recurring time quanta, with the scheduler as multiplexer and context-switch machinery saving/restoring each process's state as the demultiplexer.
- The benefit is strongest precisely when the types are confusable, since interleaving builds the discrimination that blocking lets the learner skip. Computer science: Instruction interleaving, multithreading, and time-slicing alternate work units on a shared processor to hide latency — while one thread waits on memory or I/O, another runs — and to share a scarce execution resource fairly among competing tasks.
- Multiplexing
- The scheduler is the multiplexer; the context-switch machinery is the demultiplexer that restores each process's saved state.
This sourceStandard OS text: CPU scheduling time-slices one processor among many processes via brief recurring time quanta, with the scheduler as multiplexer and context-switch machinery saving/restoring each process's state as the demultiplexer.
- The scheduler is the multiplexer; the context-switch machinery is the demultiplexer that restores each process's saved state.
- Mutual Exclusion
- In computing it is operating-system locks and semaphores, database row and table locks, atomic compare-and-swap, distributed locks, and single-leader protocols that admit at most one leader per term.
This sourceStandard treatment of locks, semaphores, the critical-section problem, and the safety/liveness/fairness properties whose failures name races, deadlock, livelock, and starvation.
- In computing it is operating-system locks and semaphores, database row and table locks, atomic compare-and-swap, distributed locks, and single-leader protocols that admit at most one leader per term.
- Scarcity
- Computer science: Contention for finite CPU cycles, memory, locks, file handles, or bandwidth among concurrent processes; the scheduler, the lock manager, and the rate limiter are all mechanisms for allocating a scarce computational resource, and system throughput is pinned by whichever resource saturates first.
This sourceCanonical OS textbook: treats contention for finite computational resources (CPU cycles, memory, locks, file handles, bandwidth) among concurrent processes and the schedulers, lock managers, and rate limiters that allocate them, with throughput pinned by the saturating resource.
- Computer science: Contention for finite CPU cycles, memory, locks, file handles, or bandwidth among concurrent processes; the scheduler, the lock manager, and the rate limiter are all mechanisms for allocating a scarce computational resource, and system throughput is pinned by whichever resource saturates first.
- Starvation
- The transfers carry concrete techniques, not just vocabulary, because the cumulative-deferral structure is the same wherever a priority rule allocates over time. Concurrency theory into human scheduling: starvation-avoidance techniques — aging, guaranteed quanta, lottery scheduling — transfer from processor scheduling into shift-scheduling, school assignment, and court-docket management, with the same liveness guarantee that no participant is perpetually deferred.
This sourceDefines starvation under strict priority scheduling and the standard remedies — aging, guaranteed minimum service, and lottery scheduling.
- The transfers carry concrete techniques, not just vocabulary, because the cumulative-deferral structure is the same wherever a priority rule allocates over time. Concurrency theory into human scheduling: starvation-avoidance techniques — aging, guaranteed quanta, lottery scheduling — transfer from processor scheduling into shift-scheduling, school assignment, and court-docket management, with the same liveness guarantee that no participant is perpetually deferred.
- Switching Cost
- In computer architecture it is CPU context switching — save and restore registers, flush the pipeline, cold cache on resume — weighed explicitly against throughput in scheduling.
This sourceCPU context switching — saving/restoring registers, flushing the pipeline, cold caches on resume — weighed against throughput in scheduling, and caching to preserve state across switches.
- In computer architecture it is CPU context switching — save and restore registers, flush the pipeline, cold cache on resume — weighed explicitly against throughput in scheduling.
- Turn Taking
- Classroom discussion: hand-raising, cold-calling, recitation sequences. Games and sports: turn-based versus real-time play, possession, service. Operating systems: process scheduling on a single core with time quanta.
This sourceStandard reference on CPU scheduling — allocating a single core among processes via time quanta and scheduling disciplines.
- Classroom discussion: hand-raising, cold-calling, recitation sequences. Games and sports: turn-based versus real-time play, possession, service. Operating systems: process scheduling on a single core with time quanta.
- Two-Store Architecture
- Operating systems pair a page cache and write buffers (fast, volatile) with disk (slow, durable), transferring during scheduled flush — and power loss inside the transfer window is the canonical failure.
This sourceDescribes the page cache and write buffers flushed to durable disk, and data loss on power failure inside the flush window.
- Operating systems pair a page cache and write buffers (fast, volatile) with disk (slow, durable), transferring during scheduled flush — and power loss inside the transfer window is the canonical failure.
Domain-specific¶
Mechanisms¶
- Traffic-Class Separation Rule
- Strict priority invites priority inversion
This sourceDefines starvation and priority inversion, including indefinite low-priority blocking and a high-priority task waiting on a low-priority resource holder.
- Strict priority invites priority inversion
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 2 other ways.
- https://www.os-book.com/OS10/ ×1
- https://www.wiley.com/en-us/Operating+System+Concepts%2C+10th+Edition-p-9781118063330 ×1
Registry ID ref:aa11ac7435d3 · see in the full table