✳flâneur — a map of the web's best reading

Strict Priority Scheduler | CS 162 Project 2

cs162.org · 797 words · saved by 1 readers

In Pintos, each thread has a priority value ranging from 0 (PRI_MIN) to 63 (PRI_MAX). However, the current scheduler does not respect these priority values. You must modify the scheduler so that higher-priority threads always run before lower-priority threads (i.e. strict priority scheduling). Note: In the case of a priority tie, you should schedule threads with the same priority value in a round robin fashion. The existing code already preempts threads once they run past their allotted time slice, so you won’t have to worry about this part of the round robin implementation. If you would like a closer look to how this is implemented, take a look at thread_tick. You must also modify the 3 Pintos synchronization primitives (lock, semaphore, condition variable), so that these shared resources prefer higher-priority threads over lower-priority threads. Additionally, you must implement priority donation for Pintos locks. When a high-priority thread (A) has to wait to acquire a lock, which i

Strict Priority Scheduler | CS 162 Project 2 Skip to main content Menu Expand (external link) Document Search Copy Copied CS 162 Project 2 Strict Priority Scheduler In Pintos, each thread has a priority value ranging from 0 ( PRI_MIN ) to 63 ( PRI_MAX ). However, the current scheduler does not respect these priority values. You must modify the scheduler so that higher-priority threads always run before lower-priority threads (i.e. strict priority scheduling). Note: In the case of a priority tie, you should schedule threads with the same priority value in a round robin fashion. The existing cod

Explore this link on the map →

related reading