Material Detail

This Web site from the University of Bridgeport provides the context and explanation for CPU scheduling mechanisms. It includes a rationale for context switching along with with pseudocode, and it explains the difference between non-preemptive versus preemptive scheduling. It offers visuals that could be incorporated into lectures analyzing various scheduling algorithms including first in first out (FIFO), round-robin, priority-based, shortest job first (SJF), and multilevel feedback queues. It includes an assignment as well as an online slideshow presentation. This site is applicable for technical/community college or university level computer science or engineering courses.

Disciplines:

• Mathematics and Statistics  / Mathematics