EECS 3221:
OPERATING SYSTEM FUNDAMENTALS
Hamzeh Khazaei
Department of Electrical Engineering and Computer Science
Week 5, Module 1:
CPU Scheduling
Feb 8, 2021
Operating System Concepts – 10th Edition 5.1 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
1
Chapter 5: CPU Scheduling
! Basic Concepts
! Scheduling Criteria
! Scheduling Algorithms
! Thread Scheduling
! Multi-Processor Scheduling
! Real-Time CPU Scheduling
! Operating Systems Examples
! Algorithm Evaluation
Operating System Concepts – 10th Edition
5.2 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
2
1
Basic Concepts
! We already know, kernel threads are the one being scheduled.
! However, the terms “process scheduling” and “thread scheduling” are often used interchangeably.
! By CPU we mainly refer to a CPU core, as the computation unit.
! Maximum CPU utilization obtained with multiprogramming
! CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait
! CPU burst followed by I/O burst
! CPU burst distribution is of main
concern
Operating System Concepts – 10th Edition 5.3 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
3
Histogram of CPU-burst Times
Large number of short bursts Small number of longer bursts
Operating System Concepts – 10th Edition 5.4 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
4
2
CPU Scheduler
! The CPU scheduler selects from among the processes in ready queue, and allocates a CPU core to one of them
! Queue may be ordered in various ways
! CPU scheduling decisions may take place when a process:
1. Switchesfromrunningtowaitingstate(I/Oorchildprocess) 2. Switchesfromrunningtoreadystate(interrupts)
3. Switchesfromwaitingtoready(I/Ocompletionorchildfinish) 4. Terminates (last instructions)
! Scheduling under 1 and 4 is nonpreemptive
! All other scheduling is preemptive (all modern OSs use this)
! Consider access to shared data (may cause race condition)
! Consider preemption while in kernel mode (interrupting a system call)
! Consider interrupts occurring during crucial OS activities
Operating System Concepts – 10th Edition 5.5 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
5
Dispatcher
! Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves:
! switching context
! switching to user mode
! jumping to the proper location in the user program to restart that program
! Dispatch latency – time it takes for the dispatcher to stop one process and start another running
Operating System Concepts – 10th Edition 5.6 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
6
3
Scheduling Criteria
! CPU utilization – keep the CPU as busy as possible
! Throughput – # of processes that complete their execution per time unit
! Turnaround time – amount of time to execute a particular process
! Waiting time – aggregated amount of time a process has been waiting in the ready queue
! This is the time that will be affected by scheduling algorithm.
! Response time – amount of time it takes from when a request was submitted
until the first response is produced, not output (for time-sharing environment) ! Interactive systems
Operating System Concepts – 10th Edition 5.7 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
7
Scheduling Algorithm Optimization Criteria
! Max CPU utilization
! Max throughput
! Min turnaround time
! Min waiting time
! Min response time
! Now let’s investigate important CPU-Scheduling algorithms.
! We assume we have only one CPU. (for now)
Operating System Concepts – 10th Edition 5.8 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
8
4
First- Come, First-Served (FCFS) Scheduling
Process Burst Time P1 24
P2 3
P3 3
! Suppose that the processes arrive in the order: P1 , P2 , P3 The Gantt Chart for the schedule is:
0 24 27 30
! WaitingtimeforP1 =0;P2 =24;P3=27
! Average waiting time: (0 + 24 + 27)/3 = 17
! FCFS can be easily implemented with a FIFO queue.
! Q: what is it that we put into the ready queue?
Operating System Concepts – 10th Edition 5.9 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
P1
P2
P3
9
FCFS Scheduling (Cont.)
! A nonpreemptive algorithm
! Suppose that the processes arrive in the order:
P2 ,P3 ,P1
! The Gantt chart for the schedule is:
036 30
! WaitingtimeforP1=6;P2 =0;P3=3
! Average waiting time: (6 + 0 + 3)/3 = 3
! Much better than previous case
! Convoy effect – short process behind long process
! Consider one CPU-bound and many I/O-bound processes ” FCFS is not good for interactive systems.
Operating System Concepts – 10th Edition 5.10 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
P2
P3
P1
10
5
Shortest-Job-First (SJF) Scheduling
! Associate with each process the length of its next CPU burst
! Use these lengths to schedule the process with the shortest time
! Shortest-next-CPU-burst to be more exact.
! SJF is optimal – gives minimum average waiting time for a given set of processes
! The difficulty is knowing the length of the next CPU request
! Could ask the user
Operating System Concepts – 10th Edition 5.11 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
11
Example of SJF
ProcessArrival Time Burst Time P1 0.0 6
P2 2.0 8
P3 4.0 7
P4 5.0 3
! SJF scheduling chart
03 9 16 24
! Averagewaitingtime=(3+16+9+0)/4=7
Operating System Concepts – 10th Edition 5.12 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
P4
P1
P3
P2
12
6
!
!
!
Determining Length of Next CPU Burst
Can only estimate the length – should be similar to the previous one ! Then pick process with shortest predicted next CPU burst
Can be done by using the length of previous CPU bursts, using exponential averaging
Commonly, α set to 1⁄2
Operating System Concepts – 10th Edition 5.13 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
13
Prediction of the Length of the Next CPU Burst
An exponential average with α =1/2 and τ0 = 10
Operating System Concepts – 10th Edition 5.14 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
14
7
Examples of Exponential Averaging
! a=0
! tn+1 = tn
! Recent history does not count ! a=1
! tn+1=atn
! Only the actual last CPU burst counts ! If we expand the formula, we get:
tn+1 =atn+(1-a)atn-1+…+(1-a)jatn-j +… + (1 – a )n+1 t0
! Sincebothaand(1-a)arelessthanorequalto1,each successive term has less weight than its predecessor
Operating System Concepts – 10th Edition 5.15 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
15
Preemptive vs non-preemptive
! The SJF algorithm can be either preemptive or nonpreemptive.
! The choice arises when a new process arrives at the ready queue while a
previous process is still executing.
! The next CPU burst of the newly arrived process may be shorter than what is left of the currently executing process.
! A preemptive SJF algorithm will preempt the currently executing process, whereas a non-preemptive SJF algorithm will allow the currently running process to finish its CPU burst.
! Preemptive SJF scheduling is sometimes called shortest-remaining-time-first scheduling.
Operating System Concepts – 10th Edition 5.16 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
16
8
!
!
!
Example of Shortest-remaining-time-first
Now we add the concepts of varying arrival times and preemption to the analysis
Process i Arrival Time Burst Time P1 0 8
P2 1 4
P3 2 9
P4 3 5 Preemptive SJF Gantt Chart
0151017 26
Average waiting time = [(10-1)+(1-1)+(17-2)+(5-3)]/4 = 26/4 = 6.5 msec
P1
P2
P4
P1
P3
Operating System Concepts – 10th Edition 5.17 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
17
Round Robin (RR)
! Each process gets a small unit of CPU time (time quantum q), usually 10-100 milliseconds. After this time has elapsed, the process is preempted and added to the end of the ready queue.
! If there are n processes in the ready queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units at once. No process waits more than (n-1)q time units.
! Timer interrupts every quantum to schedule next process
! Performance
! q large Þ FCFS
! q small Þ q must be large with respect to context switch, otherwise
overhead is too high
! The average waiting time under the RR policy is often long.
Operating System Concepts – 10th Edition 5.18 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
18
9
!
! ! !
Example of RR with Time Quantum = 4
Process Burst Time P1 24
P2 3
P3 3 The Gantt chart is:
0 4 7 10 14 18 22 26 30
Typically, higher average turnaround than SJF, but better response q should be large compared to context switch time
q usually 10ms to 100ms, context switch < 10 usecP1 P2P3P1 P1P1 P1 P1 Operating System Concepts – 10th Edition 5.19 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 19 Time Quantum and Context Switch TimeOperating System Concepts – 10th Edition 5.20 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20202010Turnaround Time Varies With The Time Quantum80% of CPU bursts should be shorter than qOperating System Concepts – 10th Edition 5.21 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@202021End of Part 1ANY Q?Operating System Concepts – 10th Edition 5.22 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20202211Priority Scheduling! A priority number (integer) is associated with each process! The CPU is allocated to the process with the highest priority (biggest value ohighest priority)! Preemptive! Nonpreemptive! SJF is priority scheduling where priority is the inverse of predicted next CPU burst time! Problem o Starvation – low priority processes may never execute! Solution o Aging – as time progresses increase the priority of the processOperating System Concepts – 10th Edition 5.23 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 23 Example of Priority SchedulingProcessA arri Burst TimeT Priority P1 10 3 P2 1 1 P3 2 4 P4 1 5P5 5 2! Priority scheduling Gantt Chart! Average waiting time = 8.2 msecOperating System Concepts – 10th Edition 5.24 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 2412Priority Scheduling w/ Round-RobinProcessA arri Burst TimeT Priority P1 4 3 P2 5 2 P3 8 2 P4 7 1P5 3 3q Run the process with the highest priority. Processes with the same priority runround-robin! Gantt Chart wit 2 ms time quantumOperating System Concepts – 10th Edition 5.25 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 25 Multilevel Queue ?! With priority scheduling, have separate queues for each priority.! Schedule the process in the highest-priority queue!Any idea how we can implement aging? To avoid starvation?Operating System Concepts – 10th Edition 5.26 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20202613Multilevel Queue! Prioritization based upon process typeOperating System Concepts – 10th Edition 5.27 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@202027 Multilevel Feedback Queue! A process can move between the various queues; aging can be implemented this way! Multilevel-feedback-queue scheduler defined by the following parameters:! number of queues! scheduling algorithms for each queue! method used to determine when to upgrade a process! method used to determine when to demote a process! method used to determine which queue a process will enter when thatprocess needs serviceOperating System Concepts – 10th Edition 5.28 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 2814Example of Multilevel Feedback Queue! Three queues:! Q0 – RR with time quantum 8 milliseconds! Q1 – RR time quantum 16 milliseconds! Q2 – FCFS! Scheduling! A new job enters queue Q04 When it gains CPU, job receives 8 milliseconds4 If it does not finish in 8 milliseconds, job is moved to queue Q1! At Q1 receives 16 additional milliseconds 4 If it still does not complete, it ispreempted and moved to queue Q2! A process that arrives from Q1 will preempt a process in Q2. A process in Q1 will in turn be preempted by a process arriving for Q0.Operating System Concepts – 10th Edition 5.29 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@202029 Multiple-Processor Scheduling! CPU scheduling more complex when multiple CPUs are available! Multiprocess may be any one of the following architectures:! Multicore CPUs! Multithreaded cores! NUMA systems! Heterogeneous multiprocessingOperating System Concepts – 10th Edition 5.30 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 3015Multiple-Processor Scheduling! Symmetric multiprocessing (SMP) is where each processor is self scheduling.! All threads may be in a common ready queue (a)! Each processor may have its own private queue of threads (b)Operating System Concepts – 10th Edition 5.31 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@202031 Multicore Processors?! Recent trend to place multiple processor cores on same physical chip! Faster and consumes less power! Multiple threads per core also growing! Takes advantage of memory stall to make progress on another thread while memory retrieve happensOperating System Concepts – 10th Edition 5.32 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20203216Multithreaded Multicore SystemEach core has > 1 hardware threads.
If one thread has a memory stall, switch to another thread!
Operating System Concepts – 10th Edition 5.33 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
33
Multithreaded Multicore System
! Chip-multithreading (CMT) assigns each core multiple hardware threads. (Intel refers to this as hyperthreading.)
! On a quad-core system with 2 hardware threads per core, the operating system sees 8 logical processors.
Operating System Concepts – 10th Edition 5.34
Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
34
17
Multithreaded Multicore System
! Two levels of scheduling:
1. The operating system deciding which software thread to run on a logical CPU
2. How each core decides which hardware thread to run on the physical core.
Operating System Concepts – 10th Edition
5.35 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
35
Multiple-Processor Scheduling – Load Balancing
! If SMP, need to keep all CPUs loaded for efficiency
! Load balancing attempts to keep workload evenly distributed
! Push migration – periodic task checks load on each processor, and if found pushes task from overloaded CPU to other CPUs
! Pull migration – idle processors pulls waiting task from busy processor
Operating System Concepts – 10th Edition 5.36 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
36
18
Multiple-Processor Scheduling – Processor Affinity
! When a thread has been running on one processor, the cache contents of that processor stores the memory accesses by that thread.
! We refer to this as a thread having affinity for a processor (i.e. “processor affinity”)
! Load balancing may affect processor affinity as a thread may be moved from one processor to another to balance loads, yet that thread loses the contents of what it had in the cache of the processor it was moved off.
! Soft affinity – the operating system attempts to keep a thread running on the same processor, but no guarantees.
! Hard affinity – allows a process to specify a set of processors it may run on.
Operating System Concepts – 10th Edition 5.37 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
37
NUMA and CPU Scheduling
If the operating system is NUMA-aware, it will assign memory closes to the CPU the thread is running on.
CPU
fast access memory
CPU
fast access memory
computer
Operating System Concepts – 10th Edition 5.38 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
38
19
slow access
Real-Time CPU Scheduling
! Can present obvious challenges
! Soft real-time systems – Critical real-time tasks have the highest priority, but
no guarantee as to when tasks will be scheduled
! Hard real-time systems – task must be serviced by its deadline
Operating System Concepts – 10th Edition 5.39 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
39
Real-Time CPU Scheduling
! Event latency – the amount of time that elapses from when an event occurs to when it is serviced.
! Two types of latencies affect performance
1. Interrupt latency – time from arrival of interrupt to start of routine that services interrupt
2. Dispatch latency – time for schedule to take current process off CPU and switch to another
Operating System Concepts – 10th Edition 5.40 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
40
20
Interrupt Latency
Operating System Concepts – 10th Edition 5.41 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
41
End of Part 2.
ANY Q?
Operating System Concepts – 10th Edition 5.42 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
42
21
! Conflict phase of dispatch latency:
1. Preemption of any process running in kernel mode
2. Release by low- priority process of resources needed by high-priority processes
Operating System Concepts – 10th Edition
5.43 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
Dispatch Latency
43
Priority-based Scheduling
! For real-time scheduling, scheduler must support preemptive, priority-based scheduling
! But only guarantees soft real-time
! For hard real-time must also provide ability to meet deadlines
! Processes have new characteristics: periodic ones require CPU at constant intervals
! Has processing time t, deadline d, period p
! 0≤t≤d≤p
! Rate (aka frequency) of periodic task is 1/p
! Utilization (u) = t/p
Operating System Concepts – 10th Edition 5.44 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
44
22
Rate Monotonic Scheduling (RMS)
! A priority is assigned based on the inverse of its period
! Shorter periods = higher priority;
! Longer periods = lower priority
! P1 is assigned a higher priority than P2.
! P1=50, t1=20, P2=100, t2=35
! u1=20/40 = 0.4, u2=35/100 = 0.35 à ut = 0.75
Operating System Concepts – 10th Edition 5.45 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
45
Missed Deadlines with Rate Monotonic Scheduling
! P1=50, t1=25, P2=80, t2=35
! u1=25/50 = 0.5, u2=35/80 = 0.44 à ut = 0.94
! Process P2 misses finishing its deadline at time 80
! Max utilization when having N processes in the system: N(21/N − 1)
! With two processes, CPU utilization is bounded at about 83%.
! With one process in the system, CPU utilization is 100%, but it falls to
approximately 69% as the number of processes approaches infinity.
Operating System Concepts – 10th Edition 5.46 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
46
23
Earliest Deadline First Scheduling (EDF)
! Priorities are assigned according to deadlines: the earlier the deadline, the higher the priority;
the later the deadline, the lower the priority
Operating System Concepts – 10th Edition 5.47 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
Rate Monotonic Scheduling
47
POSIX Real-Time Scheduling
! The POSIX.1b standard
! API provides functions for managing real-time threads
! Defines two scheduling classes for real-time threads:
1. SCHED_FIFO – threads are scheduled using a FCFS strategy with a FIFO queue. There is no time-slicing for threads of equal priority
2. SCHED_RR – similar to SCHED_FIFO except time-slicing occurs for threads of equal priority
! Defines two functions for getting and setting scheduling policy:
1. pthread_attr_getsched_policy(pthread_attr_t *attr,
int *policy)
2. pthread_attr_setsched_policy(pthread_attr_t *attr, int policy)
Operating System Concepts – 10th Edition 5.49 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
49
24
POSIX Real-Time Scheduling API
#include
#define NUM_THREADS 5
int main(int argc, char *argv[]) {
int i, policy; pthread_t_tid[NUM_THREADS];
pthread_attr_t attr;
/* get the default attributes */
pthread_attr_init(&attr);
/* get the current scheduling policy */
if (pthread_attr_getschedpolicy(&attr, &policy) != 0)
fprintf(stderr, “Unable to get policy.
”); else {
if (policy == SCHED_OTHER) printf(“SCHED_OTHER
”); else if (policy == SCHED_RR) printf(“SCHED_RR
”); else if (policy == SCHED_FIFO) printf(“SCHED_FIFO
”);
}
Operating System Concepts – 10th Edition 5.50 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020
50
POSIX Real-Time Scheduling API (Cont.)
/* set the scheduling policy – FIFO, RR, or OTHER */
if (pthread_attr_setschedpolicy(&attr, SCHED_FIFO) != 0)
fprintf(stderr, “Unable to set policy.
”);
/* create the threads */
for (i = 0; i < NUM_THREADS; i++)pthread_create(&tid[i],&attr,runner,NULL);/* now join on each thread */ for (i = 0; i < NUM_THREADS; i++)pthread_join(tid[i], NULL); }/* Each thread will begin control in this function */ void *runner(void *param) {/* do some work … */pthread_exit(0); }Operating System Concepts – 10th Edition5.51 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20205125Operating System Examples! Linux scheduling! Windows scheduling (not included in exams)! Solaris scheduling (not included in exams)Operating System Concepts – 10th Edition 5.52 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 52 Linux Scheduling Through Version 2.5! Prior to kernel version 2.5, ran variation of standard UNIX scheduling algorithm! Version 2.5 moved to constant order O(1) scheduling time! Preemptive, priority based! Two priority ranges: time-sharing and real-time! Real-time range from 0 to 99 and normal range nice values from 100 to 140! Map into global priority with numerically lower values indicating higher priority! Higher priority gets larger q (quantum or time slice)! Task run-able as long as time left in time slice (active)! If no time left (expired), not run-able until all other tasks use their slices! Worked well, but poor response times for interactive processesOperating System Concepts – 10th Edition 5.53 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 5326Linux Scheduling in Version 2.6.23 +” Completely Fair Scheduler (CFS)” Scheduling classes! Each has specific priority! Scheduler picks highest priority task in highest scheduling class! Rather than quantum based on fixed time allotments, based on proportion of CPU time! 2 scheduling classes included, others can be added1. default2. real-time” Quantum calculated based on nice value from -20 to +19! Lower value is higher priority! Calculates target latency – interval of time during which task should run at least once! Target latency can increase if say number of active tasks increases” CFS scheduler maintains per task virtual run time in variable vruntime! Associated with decay factor based on priority of task – lower priority is higher decay rate! Normal default priority yields virtual run time = actual run time” To decide next task to run, scheduler picks task with lowest virtual run timeOperating System Concepts – 10th Edition 5.54 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 54 CFS PerformanceOperating System Concepts – 10th Edition 5.55 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20205527Linux Scheduling (Cont.)! Real-time scheduling according to POSIX.1b ! Real-time tasks have static priorities! Real-time plus normal map into global priority scheme! Nice value of -20 maps to global priority 100! Nice value of +19 maps to priority 139Operating System Concepts – 10th Edition 5.56 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@202056 Linux Scheduling (Cont.)! Linux supports load balancing, but is also NUMA-aware.! Scheduling domain is a set of CPU cores that can be balancedagainst one another.! Domains are organized by what they share (i.e. cache memory.) Goal is to keep threads from migrating between domains.Operating System Concepts – 10th Edition 5.57 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20205728Algorithm Evaluation! How to select CPU-scheduling algorithm for an OS?! Determine criteria, then evaluate algorithms! Deterministic modeling! Type of analytic evaluation! Takes a particular predetermined workload and defines theperformance of each algorithm for that workload! Consider 5 processes arriving at time 0:Operating System Concepts – 10th Edition 5.58 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@202058 Deterministic Evaluation! For each algorithm, calculate minimum average waiting time! Simple and fast, but requires exact numbers for input, applies only tothose inputs! FCFS is 28ms:! Non-preemptive SFJ is 13ms:! RR is 23ms:Operating System Concepts – 10th Edition 5.59 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20205929Queueing Models! Describes the arrival of processes, and CPU and I/O bursts probabilistically! Commonly exponential, and described by mean! Computes average throughput, utilization, waiting time, etc! Computer system described as network of servers, each with queue of waiting processes! Knowing arrival rates and service rates! Computes utilization, average queue length, average wait time, etcOperating System Concepts – 10th Edition 5.60 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 60 Little’s Law! n = average queue length! W = average waiting time in queue! λ = average arrival rate into queue! Little’s law – in steady state, processes leaving queue must equal processes arriving, thus:n=λxW! Valid for any scheduling algorithm and arrival distribution! For example, if on average 7 processes arrive per second, and normally 14 processes in queue, then average wait time per process = 2 secondsOperating System Concepts – 10th Edition 5.61 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 6130Simulations! Queueing models limited! Simulations more doable:! Programmed model of computer system! Clock is a variable! Gather statistics indicating algorithm performance! Data to drive simulation gathered via4 Random number generator according to probabilities4 Distributions defined mathematically or empirically4 Trace files record sequences of real events in real systemsOperating System Concepts – 10th Edition 5.62 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 62 Evaluation of CPU Schedulers by SimulationOperating System Concepts – 10th Edition 5.63 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20206331Real Implementation! Even simulations have limited accuracy! Just implement new scheduler and test in real systems! High cost, high risk! Environments vary! Most flexible schedulers can be modified per-site or per-system! Or APIs to modify priorities! But again environments varyOperating System Concepts – 10th Edition 5.64 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@2020 64End.ANY Q?Operating System Concepts – 10th Edition 5.65 Silberschatz, Galvin and Gagne ©2018 modified by Khazaei@20206532
Reviews
There are no reviews yet.