Transcription of Chapter 5: CPU Scheduling - Welcome to Watson
{{id}} {{{paragraph}}}
Example: bachelor of science
Chapter 5: CPU Scheduling - Welcome to Watson
Silberschatz, Galvin and Gagne 2002 !Operating System Concepts! Chapter 5: CPU Scheduling ! Basic Concepts! Scheduling Criteria ! Scheduling Algorithms! Multiple-Processor Scheduling ! Real-Time Scheduling ! Algorithm Evaluation!Silberschatz, Galvin and Gagne 2002 !Basic Concepts! Long-term scheduler is invoked very infrequently (seconds, minutes) (may be slow)! The long-term scheduler controls the degree of multiprogramming (how many jobs are admitted to run on CPU)! Short-term scheduler is invoked very frequently (milliseconds) (must be fast) = process Scheduling on CPU ! Processes can be described as either:! I/O-bound process spends more time doing I/O than computations, many short CPU bursts! CPU-bound process spends more time doing computations; few very long CPU bursts!Silberschatz, Galvin and Gagne 2002 !Operating System Concepts!Basic Concepts! Maximum CPU utilization obtained with multiprogramming!
Operating System Concepts! 6.1! Silberschatz, Galvin and Gagne ©2002 Chapter 5: CPU Scheduling! Basic Concepts! Scheduling Criteria ! Scheduling Algorithms!
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
R O B I N, Eating An Anthropological Perspective, Eating: An Anthropological Perspective, Robin, Gigabit ET Multi-Port Server, Gigabit ET Multi-Port Server Adapters, Home Office Circular 6 - 2006, Home Office Circular 6 / 2006, Facilitator, University of, Name Country Email, Computer Security Incident Handling Guide