s16 operating system scheduling algorithms
TRANSCRIPT
-
7/25/2019 S16 Operating System Scheduling Algorithms
1/7
Oscar Guillermo Castro
Dr. Fink
1 October 2015
Operating Systems
Project
. Statistics
FCFS !! S"F Priority 1 Priority 20
200
#00
$00
%00
1000
1200
&urn 'roun( &ime
"ob1 "ob2 "ob)
FCFS !! S"F Priority 1 Priority 20
50
100
150
200
250
)00
)50
#00
#50
!un State &ime
"ob1 "ob2 "ob)
-
7/25/2019 S16 Operating System Scheduling Algorithms
2/7
FCFS !! S"F Priority 1 Priority 20
5
10
15
20
25
)0
)5
#0
#5
!un State Count
"ob1 "ob2 "ob)
FCFS !! S"F Priority 1 Priority 20
50100
150
200
250
)00
)50
#00
#50
!ea(y State &ime
"ob1 "ob2 "ob)
-
7/25/2019 S16 Operating System Scheduling Algorithms
3/7
FCFS !! S"F Priority 1 Priority 20
5
10
15
20
25
)0
)5
#0
#5
!ea(y State Count
"ob1 "ob2 "ob)
FCFS !! S"F Priority 1 Priority 20
100200
)00
#00
500
$00
*00
%00
+00
,ait State &ime
"ob1 "ob2 "ob)
-
7/25/2019 S16 Operating System Scheduling Algorithms
4/7
FCFS !! S"F Priority 1 Priority 20
2
#
$
%
10
12
1#
,ait State Count
"ob1 "ob2 "ob)
. '-erages
FCFS !! S"F P!O!& 1 P!O!& 20
100
200
)00
#00
500
$00
*00
%00
+00
1000
'/G &urn 'roun( &ime
-
7/25/2019 S16 Operating System Scheduling Algorithms
5/7
FCFS !! S"F P!O!& 1 P!O!& 20
50
100
150
200
250
)00
'/G !ea(y State &ime
FCFS !! S"F P!O!& 1 P!O!& 2)$0
)%0
#00
#20
##0
#$0
#%0
'/G ,ait State &ime
-
7/25/2019 S16 Operating System Scheduling Algorithms
6/7
. Contet Sitces
FCFS !! S"F P!O!& 1 P!O!& 20
5
10
15
20
25
)0
)5
#0
#5
50
Contet Sitces
/. 3uestionsa. ,ic meto( seems more 4air6 it respect to all job types
!oun( robin seems to be te most air because o te re7uent contet sitces
ic allos te jobs to a-e loer -alues in te rea(y state time8 meaning eac
job spen(s more time being ran.
b. ,ic a-ors 9O:boun( jobs
First come8 ;rst out a-ors O jobs because tey spen( less time in te rea(y statecount. FFO allos O:boun( jobs to ;nis so long as tey enter te 7ueue beore
anoter job.
c. ,ic a-ors CP
-
7/25/2019 S16 Operating System Scheduling Algorithms
7/7
e. ?o can priority sce(uling elp or in(er te issues o turnaroun( an(
trougput=
Priority can elp in (eman( jobs be processe( an( in(er jobs o (o not a-e a
ig priority. n te Priority 1 an( Priority 2 traces8 one can see o a-ing te
igest priority oul( allo or tat job to be processe( 7uickly ile te least
prioriti@e( a-e teir turnaroun( time increase(.