Search results with tag "Cpu scheduling"
Chapter 5: CPU Scheduling - Welcome to Watson
www2.latech.eduOperating System Concepts! 6.1! Silberschatz, Galvin and Gagne ©2002 Chapter 5: CPU Scheduling! Basic Concepts! Scheduling Criteria ! Scheduling Algorithms! Multiple-Processor Scheduling! Real-Time Scheduling! Algorithm Evaluation!
OPERATING SYSTEMS OVERVIEW - WPI
web.cs.wpi.edu1: Operating Systems Overview 5 The CPU is wasted if a job waits for I/O. This leads to: • Multiprogramming ( dynamic switching ). While one job waits for a resource, the CPU can find another job to run. It means that several jobs are ready to run and only need the CPU in order to continue. CPU scheduling is the subject of Chapter 6.
Operating Systems : CPU Scheduling
cse.iitm.ac.in• Processes assigned to a priority classes • Each class has its own ready queue • Scheduler picks the highest priority queue (class) which has at least one ready process • Selection of a process within the class could have its own policy – Typically round robin (but can be changed) – High priority classes can implement