Transcription of Chapter 5: CPU Scheduling
{{id}} {{{paragraph}}}
Example: biology
Chapter 5: CPU Scheduling
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
SAS Scheduling: Getting the Most, SAS® Scheduling: Getting the Most Out, Enhanced grinder framework with scheduling, Enhanced Grinder Framework with Scheduling and Improved, Process Management, Scheduling, The History of Primavera Scheduling, SQL Server 2008 Compare Edition Features, GE Fanuc Automation, System Programmer's Guide to: Workload, System Programmer’s Guide to: Workload