Publisher: Arpaci-Dusseau Books.
Chapter 37 of Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others. Section 37.3 separates seek, rotational delay and transfer time; the later scheduling discussion compares shortest-seek and directional-sweep policies. The parent record supplies the authors and version metadata.
Chapter 15 of Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others. The existing parent-book record supplies the authors and 2023 version 1.10 metadata; no separate chapter date or author is inferred.
Cited passages: Chapter 15, printed pp. 1–2: hardware translation and operating-system control.
Chapter 19 of Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others. The existing parent-book record supplies the authors and 2023 version 1.10 metadata; no separate chapter date or author is inferred.
Cited passages: Chapter 19, §§19.1, 19.3–19.4, printed pp. 2, 6, 8: permission checks, refill ownership and cached attributes; §19.5, printed pp. 9–10: flushing and address-space identifiers.
Chapter 21 of Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others. The existing parent-book record supplies the authors and 2023 version 1.10 metadata; no separate chapter date or author is inferred.
Cited passages: Chapter 21, §§21.2–21.5, printed pp. 3–7: present bit, terminology aside and Figures 21.2–21.3.
Cited passages: Chapter 23, section 23.1, printed pp. 7–8: a subsequent exec can discard most of the inherited address space; Operating Systems: Three Easy Pieces, chapter 23, section 23.1, Other Neat Tricks, printed pp. 7–8: protected sharing, copying on a write, and fork/exec motivation.
Cited passages: Chapter 28, sections 28.1–28.2 and 28.7–28.8: ownership, multiple lock objects, and spinning; Chapter 28, sections 28.6–28.7, figures 28.1–28.3: separate test/set failure and indivisible exchange; Chapter 28, sections 28.7–28.8, printed pp. 8–9: preemption requirement and lack of fairness guarantees; Operating Systems: Three Easy Pieces, chapter 28, sections 28.1–28.2, printed pp. 1–2: lock ownership and critical sections.
Cited passages: Chapter 32, section 32.3, Prevention: Circular Wait, printed pp. 7–8: consistent acquisition ordering and hidden calls; Operating Systems: Three Easy Pieces, chapter 32, section 32.3, printed pp. 5–7, figures 32.6–32.7: opposing acquisition orders and circular wait.
Cited passages: Arpaci-Dusseau and Arpaci-Dusseau, OSTEP chapter 22, equation 22.1: average memory access time; Arpaci-Dusseau and Arpaci-Dusseau, OSTEP chapter 22, section 22.11: Thrashing; Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau, Operating Systems: Three Easy Pieces, chapter 22, section 22.5 and the Types of Locality aside.
Cited passages: Chapter 40, section 40.7, printed pp. 14–16: caching and buffering.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

Incoming links (7)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version