Lecture19.pdf
web.stanford.edu · 2,530 words · saved by 1 readers
N/A
CS111, Lecture 19 Preemption and Implementing Locks This document is copyright (C) Stanford Computer Science and Nick Troccoli, licensed under 😷 masks recommended Creative Commons Attribution 2.5 License. All rights reserved. Based on slides and notes created by John Ousterhout, Jerry Cain, Chris Gregg, and others. NOTICE RE UPLOADING TO WEBSITES: This content is protected and may not be shared, 1 uploaded, or distributed.…
related reading
- CS111 Assignment 5: Dispatching and Implementing Locks/CVsweb.stanford.edu
- Disabling interrupts | Pintos Documentationcs162.org
- CS111 Assignment 5: Dispatching and Implementing Locks/CVsweb.stanford.edu
- Slice Dat Time | Putting the "You" in CPUcpu.land
- CS111 Section 6: Preemption and Virtual Memoryweb.stanford.edu
- Understanding threads | Pintos Documentationcs162.org
- LittleBookOfSemaphores.pdfgreenteapress.com
- CS111 Section 6: Preemption and Virtual Memoryweb.stanford.edu
- Measuring Mutexes, Spinlocks and how Bad the Linux Scheduler Really is | Probably Danceprobablydance.com
- Spinlocks Considered Harmfulmatklad.github.io
- Unreliable Guide To Locking — The Linux Kernel documentationdocs.kernel.org
- Strict Priority Scheduler | CS 162 Project 2cs162.org