- 在线时间
- 1630 小时
- 最后登录
- 2024-1-29
- 注册时间
- 2017-5-16
- 听众数
- 82
- 收听数
- 1
- 能力
- 120 分
- 体力
- 564647 点
- 威望
- 12 点
- 阅读权限
- 255
- 积分
- 174617
- 相册
- 1
- 日志
- 0
- 记录
- 0
- 帖子
- 5313
- 主题
- 5273
- 精华
- 3
- 分享
- 0
- 好友
- 163
TA的每日心情 | 开心 2021-8-11 17:59 |
|---|
签到天数: 17 天 [LV.4]偶尔看看III 网络挑战赛参赛者 网络挑战赛参赛者 - 自我介绍
- 本人女,毕业于内蒙古科技大学,担任文职专业,毕业专业英语。
 群组: 2018美赛大象算法课程 群组: 2018美赛护航培训课程 群组: 2019年 数学中国站长建 群组: 2019年数据分析师课程 群组: 2018年大象老师国赛优 |
; F% }1 q5 m0 H: |; ^【计算机操作系统】作业调度算法的 C++ 实现(附源码)6 p' u8 s+ _) R. Q4 C- }% `0 Q" [, o
文章目录. y. ]5 _0 i0 O6 U
一、实验目的* ^# I0 x( M3 o$ c" q
二、实验内容) U) e% m! A6 e/ }' U {" Y
2.1 单道处理系统的作业调度
: Y( L0 w0 D, V" L9 r o3 _2.2 多道程序系统的作业调度
U2 l# ]# C, d* a7 E% L3 G三、流程图; J+ B6 E- d3 W* Q% V
3.1 单道批处理系统的作业调度
+ o' D- j3 I: U2 c8 r2 w四、设计思想
) n1 m4 z/ C6 ~4.1 设计思路
" x, a$ F+ W4 r+ y$ D6 I& D& }% p( M4.2 单道批处理系统
' `/ U/ O8 {5 {, U( O d4.2.1 代码结构6 I% V% t4 ~- m6 n: V5 V. h7 ]; |9 G
4.2.2 FCFS
, c1 Y' Q8 N! h( f: C$ m- |. p% X* v4.2.3 SJF2 I: G2 h% S+ A! p7 j+ K2 n. E
4.2.4 HRRN
( g7 b a& T9 R3 f4.3 多道批处理系统
2 e7 S8 a; a* M: _) X0 A4.3.1 FCFS + PSA7 q/ P. s% |% S6 {3 Y( q
五、代码实现
; |" i* s: g5 m$ d u; x% y% t- F y六、运行结果
# [4 r5 F4 C3 M. `/ \) \6.1 单道批处理(FCFS)
! g' d- a. S5 v) O, {) Q) a6.2 单道批处理(SJF)
5 u; A8 G+ ?' ~ ^- O! {5 p+ A/ N$ r6.3 单道批处理(HRRN)
: P+ E1 ^" ^# o6.4 多道批处理(FCFS + PSA)
! F% N" q' O" z4 j$ u" U七、结尾6 h4 e) ~1 p6 ], {; t
一、实验目的( q! r* n; b; u) d
用高级语言编写和调试一个或多个作业调度的模拟程序,以加深对作业调度算法的理解。因为源码中我对一些关键步骤的注释已经比较清晰了,所以在本文中不会再对每一个细节都进行分析,只分析整体的代码结构和所使用到的设计模式。
) M9 {( i( E. I$ u: C" L2 W
2 \3 @& D1 B& ~+ x5 I& E0 H 博客内所有文章均为 原创,所有示意图均为 原创,若转载请附原文链接。
6 M P/ R( e2 T6 W, \5 r( D3 H' Y. t' s+ |1 W/ {# b& t
二、实验内容2 I- E6 [4 O0 @2 d
2.1 单道处理系统的作业调度8 [7 j) b8 m) h+ k" c4 s
作业调度算法:分别采用先来先服务(FCFS),最短作业优先(SJF)、响应比高者优先(HRRN)的调度算法。
6 p2 _- \- M" z. p 对每种调度算法都要求打印每个作业开始运行时刻、完成时刻、周转时间、带权周转时间,以及这组作业的平均周转时间及带权平均周转时间,以比较各种算法的优缺点。1 f7 W! t+ [, F; Z {
& k, Z' H, G( ?* N& h* E r9 Y2.2 多道程序系统的作业调度$ L9 a/ ^0 S# Y9 ]( W5 W0 A0 s
作业调度算法:采用基于先来先服务的调度算法或基于优先级的作业调度算法。
2 N6 W6 U0 N$ u: _ 对于多道程序系统,要假定系统中具有的各种资源及数量、调度作业时必须考虑到每个作业的资源要求。5 q- W g" ?" X4 o
; [5 x) _4 f. e4 U/ I7 _
三、流程图2 N; H9 k8 [+ }
3.1 单道批处理系统的作业调度6 Q3 x5 t- ?( w5 ]
1 M2 j. l. B; B* ^2 H9 X2 i
* S% N$ s+ I' ~4 K1 V0 f四、设计思想5 r' G5 ]. i4 \
4.1 设计思路
; M% b4 n) _, b& ^: {4 x6 w/ n5 s 对于单道批处理系统,由于在单道批处理系统中,作业一投入运行,它就占有计算机的一切资源直到作业完成为止,因此调度作业时不必考虑它所需要的资源是否得到满足,它所占用的 CPU时限等因素。( B# ?; _, w3 ^% v) f3 X0 Y
作业调度算法:采用先来先服务(FCFS)调度算法,即按作业提交的先后次序进行调度。总是首先调度在系统中等待时间最长的作业。每个作业由一个作业控制块JCB表示,JCB可以包含如下信息:作业名、提交时间、所需的运行时间、所需的资源、作业状态、链指针等等。
3 r+ ?; C: s. f 作业的状态可以是等待W(Wait)、运行R(Run)和完成F(Finish)三种状态之一。每个作业的最初状态总是等待W。各个等待的作业按照提交时刻的先后次序排队,总是首先调度等待队列中队首的作业。每个作业完成后要打印该作业的开始运行时刻、完成时刻、周转时间和带权周转时间,这一组作业完成后要计算并打印这组作业的平均周转时间、带权平均周转时间。
7 R1 m* f) B X. Q' Z而对于多道批处理系统来说,作业调度(响应比)按一定的算法从磁盘上的“输入井”中选择资源能得到满足的作业装入内存,使作业有机会去占用处理器执行。但是,一个作业能否占用处理器,什么时间能够占用处理器,必须由进程调度来决定。所以,作业调度选中 了一个作业且把它装入内存时,就应为该作业创建一个进程,若有多个作业被装入内存,则内存中同时存在多个进程,这些进程的初始状态为就绪状态,然后,由进程调度(优先数)来选择当前可占用处理器的进程,进程运行中由于某种原因状态发生变化,当它让出处理器时,进程调度就再选另一个作业的进程运行。 因此,作业调度与进程调度相互配合才能实现多道作业的并行执行。
5 @5 l+ p }" q, W: e/ T7 x' Q1 H- H. L3 I4 A( t8 C% ?$ ~
4.2 单道批处理系统
2 P" _" r6 t. I4.2.1 代码结构) a( f z% _, r/ I' @9 d; O7 h
因为这里的单道批处理系统需要实现多种算法,因此使用了 模板方法设计模式 + 策略模式 来进行开发,下面为各种算法的类签名,算法的具体实现可见代码实现。
6 }* f: L. f( I+ |5 H5 s
$ |4 a: [, E/ g9 _1 O+ @1 k/ H/* 单道批处理系统基类 */5 Z3 [6 M3 A' g( p4 h9 |. D
class SchedulingAlgorithm;6 X9 j6 M8 G6 L
B# _4 u7 B( H5 h. G
/* First-Come First-Served 先来先服务算法 */0 f8 M, V) j, \" k$ k r& l6 p9 N
class FCFSSchedulingAlgorithm : public SchedulingAlgorithm;
2 A8 |1 T, |+ P* ~/ |8 l
f( p$ C9 d2 [' J( |; ?/* Short Job First 短作业优先算法 */" _4 }/ s! b: j3 A* ?9 Q9 J
class SJFSchedulingAlgorithm : public SchedulingAlgorithm;
/ C& L. A" h) s8 M/ |7 J( T
$ }- y, O) J) w; O! O% r/* Highest Response Ratio Next 高响应比优先算法 */
2 Z$ f8 d6 |, ]8 @2 Dclass HRRNSchedulingAlgorithm : public SchedulingAlgorithm;7 R4 c* c% A8 I9 K. E, L
1
5 J! P5 ~6 q1 O8 \) X) R: q" O7 y23 c) X5 @0 u7 _) |' y( [
3
: c2 b8 L' a/ U8 ]3 u0 Z1 p4
0 I$ O' B4 B" P+ d& W( U+ s. P2 f" [5! R( S# m( L- C' k2 f/ U. W. F
62 j, V( i) \- x" }7 L& G
7. D. `9 v6 f3 d- I- X
8
# D( m0 p- F$ j" f& T: x. w( U9. J y& j2 ?: {( ~9 _1 O. p
105 {1 s4 i& s! C$ j+ f
11
9 X1 _5 t. b$ }2 T& h+ P4.2.2 FCFS& ]9 G$ s" N) b
因为这里使用优先级队列来实现,所以我们只需要为每种算法定义不同的比较函数即可,比如对于FCFS算法来说,它的比较算法就是比较该作业提交的时间。6 H; ?3 r4 w/ [
4 \3 g: y1 s% U0 r. W* _
// First-Come First-Served2 t' A& i$ J( [9 I$ A5 S& b1 S
class FCFSSchedulingAlgorithm : public SchedulingAlgorithm
8 F( l: \' O* W! Z{
) L0 c3 q# ^( _) Rpublic:( K; @9 w4 ^" M: \. {
struct PriorityCmp% F% _' z6 k+ c3 r6 y+ U" J
{
8 ^' L2 H* T, y0 O7 q* |5 t2 H bool operator()(const JCB j1, const JCB j2) f! t' a/ y! r4 V0 P( Z' f
{: C9 @3 y1 x- X7 \" Z
return j1.submit_time > j2.submit_time;$ W" ?6 C6 F9 w9 e! E; Z
}/ Z9 ?$ i4 i2 C X6 L
};# R! f) J1 }6 n/ G2 x9 W
+ k+ h V5 @/ N FCFSSchedulingAlgorithm(){}
7 b; C c N" j* o; D& ~};" d$ ]; d( n) Y2 g0 G5 V* Q& ~( ^
1
3 s2 j' K, P. P2 f6 v8 a2 i2
3 S V# y& T* d2 D; B33 b3 Y: G& A+ K; {% f3 }
48 q* E0 h7 |$ b. Q% v
52 O3 n3 S, M" m+ w2 S
6
# M4 m* b- h- }: D: p: O( v7
& s T7 d% T4 y7 ~2 |: W9 X7 j2 R4 D8
! T6 k2 F d4 B9
! ^1 C* O3 ^8 j; }+ C7 c2 @10
, h6 t" {* M8 Z: d8 @7 J11
5 f7 T( _ O3 p4 v G# V12/ N% k: i* o9 S. b5 w* y- s
13
0 f5 i1 g9 Y7 F# C9 D14
, |) N* w2 s! S( u+ V: H4.2.3 SJF0 [' k- j% l0 d" X% M' W
对于SJF算法来说,它的比较函数就是比较作业的时间长度(时间越短优先级越高)。
+ r# f. O6 P0 I- j- _
, O* O8 N) v' C) ~" a, }$ k2 S// Short Job First" [$ l& j. G9 H' A* O0 J
class SJFSchedulingAlgorithm : public SchedulingAlgorithm0 k" m1 }0 Y9 Y4 N* }5 o9 j
{ Z4 k7 h$ L; q
public:8 x9 `" q: J. R% j4 }
struct PriorityCmp& Y/ [3 e n8 `0 y0 b y s! |
{/ d0 X# d! i1 I; c$ M
bool operator()(const JCB j1, const JCB j2). A- x. O+ M7 _, d$ Z# S; _
{
4 y% s( x, `% Z$ q. _ return j1.required_running_time > j2.required_running_time;
* f4 C$ B$ ~0 Q! S1 w P$ p* V" v }
$ n3 G4 Y* {9 |1 A1 e' G0 D: s };$ _5 d5 w* Q& }; M. `
) U, _' p$ n, f/ o% ~ SJFSchedulingAlgorithm(){}8 }8 a& G5 W l, I2 i) Z
};* y5 r1 v7 _. i7 Y- }. S
1
7 h9 @1 {' C) k) r+ n: h2
. o4 Y% f: Z) F" m. T9 R6 V3! q! W; X2 N* b' X5 w r: ?# x
4
$ p# u3 Z6 e, r6 r5! d! b: w& l) R
6
) j, Z1 {2 [1 ~0 G1 Y4 Z7; M3 z3 N+ g+ ]: F) O
8
9 v6 O9 c! n' ?7 g8 b9; p6 {; v: w- F# c6 [0 u' o9 p
10
0 ]% J! d& m/ `; y6 [* W' h113 S, b" w. { c3 K/ Y
12
* V" M% U) o! J% T& ]13
. z3 j) J0 w) T143 U6 P& B+ J2 k/ d& n
4.2.4 HRRN3 L7 c+ u7 x0 b6 n$ J( x
该算法的比较函数比较的是每个作业的响应比:(等待时间+要求服务时间)/要求服务时间,响应比越高,优先级越高,越优先被调度。8 R* L: B& ?9 }7 V5 G1 h" e
3 B3 v, _, h9 s2 y+ V- q, W8 \0 w# E
// Highest Response Ratio Next
) a+ Z0 O ~9 E& @, q3 G2 Fclass HRRNSchedulingAlgorithm : public SchedulingAlgorithm, n4 J$ |4 k% `) {3 o ~6 \* Z
{- \& n$ k* w+ r/ J" `5 s
public:8 A5 _& }- L. o% j8 ~7 E1 ?9 e
struct PriorityCmp, }7 |9 T' I/ C8 I& v
{
; t7 n% ^! \ I- \( @/ y, Y" ~0 j double getPriority(JCB jcb)
% h9 [- i0 }+ l- \ {3 D3 D* P) k6 y" ~3 p. k8 S6 {0 e
return ((cur_time - jcb.submit_time) + jcb.required_running_time) / jcb.required_running_time;( |3 v1 \: U( C8 U
}
) n: {& Q1 c* p
) r; {6 R4 T6 g- y bool operator()(const JCB j1, const JCB j2)/ C5 L; E- P1 y @+ Y
{2 c- n9 q2 C( p3 i1 ^/ v
return getPriority(j1) > getPriority(j2);+ R6 v$ z+ W8 N% p8 u
}" h& y0 y8 |1 \: U. ]8 H- u- f4 }
};
1 w! b% E$ U% u1 f1 h0 s- |0 K$ |! J h- k. j8 Y2 Y! o4 z& _
HRRNSchedulingAlgorithm(){}
! H! ]( w2 f! B* T2 g! d};
$ K2 a2 Q: s! M6 }. M1
! ^, g% A `: Y7 Q" o: x2
0 v+ Y6 D+ Y& H+ M3% z% J2 u) b1 G% g/ @ R& M1 A
4
6 c% E# y/ X: \/ E- u5
6 f2 o) h( c/ L( ~, ?6, x% n7 Z- q+ o; v! f1 v$ w
7
2 E% [+ R7 [6 B9 _2 ?: c* V5 x4 ?8+ p' ?' Y$ ?, K. s
9
8 z2 z$ A( C5 l4 X5 e10
7 M6 Q1 Q6 G8 y7 S5 F! V& G6 ]- I4 ]11
( Q; Z, i% S1 u6 }0 O- c12; a6 C. {0 |7 J3 H
13
' Z: Q( Q2 O+ w8 d4 |, W14
e- D- W! U, O# f15
% T6 s. K) i0 q$ r16
' |7 O3 _, A M8 n- h; F17- X6 ~; ^# }0 o$ `) ^* Q9 m
180 v% K% d$ T; h4 `9 Y8 w1 q
19
* P" |( K/ n! O) ]& h4.3 多道批处理系统2 E- s" Y% I* ~: a: b8 I) L3 h; v
4.3.1 FCFS + PSA4 ?5 Y& k5 V( L% M
对于多道批处理系统来说,情况会复杂一些,因为对于多道批处理系统,除了作业的调度还存在进程的调度,也就是作业调度决定该任务能不能使用处理机(有没有资格),但就算该任务被调度了,因为多道批处理系统,还需要考虑相关的资源,因此能不能使用到处理机,还要看进程的调度。
2 K; O; g5 ]0 a. e 因此在这里对于作业调度采用了FCFS算法,而对于进程的调度采用了PSA算法(静态优先级,可抢占),并且没有继续使用实验一中的进程调度算法的代码,而是重新写了一遍。% J# m; M* N4 r$ x0 C X( w! {) Z
所有的任务初始会被存放在 back_queue 中,而就绪的任务和正在运行的任务都存储于 psa_ready_queue 中,等到 psa_ready_queue 中存在空间时,会通过任务调度算法从 back_queue 中选择合适的任务进行调度,当任务(准确说是进程)被调到 psa_ready_queue 中后,会根据它的优先级判断它是否能够优先运行,如果不能就只能保持就绪状态,一直等到优先级高的进程运行完毕后再运行。9 k. X5 V* f" J1 j$ f- A0 ~* Q& L
因为这部分代码的逻辑比较复杂,所以就不在这里单独罗列了,具体可见下面的代码实现。需要注意的是多道批处理系统代码逻辑中被注释掉的代码为测试代码,可以使用其来对代码的准确性进行测试。4 U# m) p0 e. m
: d) ~$ Z: O0 L: K3 `五、代码实现
: ~) I0 \% e: U s7 l#include <iostream>
8 w' E! E% t8 Q#include <string>
% i0 b( e1 I! Y& A& K#include <vector>3 G: q2 i, J. ^& L9 A4 X
#include <queue>( }" @+ u9 G+ h$ o% M
#include <cstdlib>7 w7 \# M# _3 M3 S+ `; @9 |1 \
#include <ctime>
; ?) h- [2 s% C0 [6 L( a4 N& Z% t#include <unistd.h>$ m. K# O" G( ?# b' z
#include <iomanip>/ |- V6 j# x6 q* R
. [1 H/ [8 Z5 c0 `& q5 otypedef int TimeSlice;) e8 @3 `" {* V( x
typedef int Resource;
$ a7 h4 h* V$ B- s; K3 b8 q9 gtypedef std::queue<TimeSlice> * JobTimeSeries; c. X, C4 p' ?" p u
$ H9 e& D& s+ r7 o
TimeSlice cur_time = 0;
/ f* Z/ e% h; ?int average_turnaround_time = 0;
: U: C8 d% f4 Bdouble average_power_turnaround_time = 0;% X; K+ L1 M- A! B
$ e" e* p8 M) X) C3 M& g9 D( v
enum ProcessStatus4 s2 J7 e r# f
{1 Q9 z R1 x! U8 k; X7 ?3 c: B
Ready = 0,5 N2 l& e8 i( g
Running = 1,. ?0 l, E! Z5 Y C( a7 Z, g- r' l
//Finish = 20 n v) T% `2 n# h3 k/ n6 ~
};
0 a5 M3 |2 V6 ^% x, @9 |" {/ j) q V8 r K( l0 z+ g
typedef int Pid;
0 U, T( E* D4 x/ ftypedef int TimeSlice;
1 ]* S0 ?5 W7 I/ n% I. vtypedef int Priority;
. l! g# p# y9 k' G2 Q# l
9 e) W. t: N- n: ~# ]1 h" Y7 `struct JCB;
- \! J5 V, g, c: ntypedef JCB * JCBptr;
: g% e) m1 C' g! l
) q% v9 ]5 g ostruct PCB1 J+ H4 U) |% ?7 v' I! I' b: E
{
i2 }! p/ f" t* R; x! W# E PCB(JCBptr jcb_) : jcb(jcb_){}
0 @1 \4 y1 {2 h0 s4 A+ l+ D7 ^+ [# c Pid pid;( y* Q+ W5 e( c% [) Z
ProcessStatus status;! N/ Q* u1 f' U" @, x. j2 M8 @
Priority priority;
. c' `' i; m2 a7 { JCBptr jcb;
4 U+ t5 F7 s7 D# D( x2 G/ R};
% z7 }1 R* s/ p5 _ p0 g% F* D# h
8 k, B5 R3 i( Q( ~0 _" Otypedef PCB * PCBptr;
+ C( ~* H7 T0 a" P% D/ D5 ` {8 b9 [/ L1 t1 n1 x' }
enum JobStatus4 k) K3 b2 G1 Q0 j
{
/ Q" V6 V! n, d: M Wait = 0,6 Y( L& i' T: I, q& D" b h
Run = 1, W( ?" U4 i: p* v
Finish = 2
+ C7 S; N; o. L0 n5 q};) o) t8 j2 w5 ~& Y+ e
8 ^6 {0 N+ o; i& y3 S
struct JCB
6 E7 ]: h, d2 A) `' b5 k{
/ h2 p' b% P4 ^! U2 d3 n+ e std::string job_name;0 H; k3 T8 Y6 T) i9 _. s2 X% F
TimeSlice submit_time;. M! l$ D4 b5 [1 @' v# E/ I: M8 i
TimeSlice required_running_time;, Z, d/ a+ m( v9 ~4 L, |
5 O( F5 t( F8 \+ G
TimeSlice start_time = -1;. n" v' D* D9 L2 B1 F9 g/ [# S
TimeSlice finish_time = 0;
" w5 ]; a5 n/ l! \ TimeSlice already_run_time = 0;
* z6 r" Q2 a% o- T$ D
7 }$ F/ X; K+ U# e+ j; [8 e, W Resource required_resource;9 N3 u4 r2 ?0 B) O5 u) }$ Q
JobStatus job_status;
1 Z. @; _- Y2 W7 E. C PCBptr pcb = new PCB(this);1 T* F3 y) Z! y
};
- k1 M' i3 O" Z7 Q+ G
2 ]% J2 D5 T: W D) Y
" X0 Q3 h7 Q' v9 wclass Util
2 e! P5 p, g! I% h; j{& c" @9 x' I8 s5 E7 u
public:
, `6 T- W4 D6 V, v, {) R6 d static inline int getRandom(const int min_val, const int max_val, int match)8 s. Y& J4 ]9 i4 P$ h7 U9 @8 G% f
{
# ^7 L* J; B0 {9 [) {9 j: u srand(time(0) + match);+ l5 l. B" ]7 D/ z' n) U- l- A6 S
return rand() % (max_val - min_val - 1) + min_val;4 g2 S- a; s2 H: m' o3 ?6 o0 R: i
}# {& @4 r7 j$ M% y3 |+ X* B! m5 ~
% x* d! ^( a& A, y4 Y- {
static inline bool printJobData(const JCB jcb)- J. J5 o$ s9 Q; |; J
{
D0 \; z" `# u- R TimeSlice start_time = cur_time;1 }4 T1 n- B: s8 I2 @
TimeSlice finish_time = start_time + jcb.required_running_time;
% R( i2 c! d# [ TimeSlice turnaround_time = finish_time - jcb.submit_time;& [# D( T0 @5 ~- k3 P. B6 E
double power_turnaround_time = turnaround_time / (jcb.required_running_time / 1.0);0 ?" `6 T8 p0 l {
1 J; Q5 ^ M# V) _! V9 ^ std::cout << "[Data] " << jcb.job_name << " "
4 M1 t1 M% P+ \$ p, [5 m << " Start time: " << start_time << " "
5 _* q. R) [9 L# ] << " Finish time: " << finish_time << " "
; Y) l3 B5 k7 ^5 ^; O6 }: c0 d# S5 C << " Turnaround time: " << turnaround_time << " "5 _6 x4 t8 q& G2 a! a% D- I5 g1 Z
<< " Power turnaround time: " << std::setprecision(2) << power_turnaround_time << std::endl;+ h! f# G8 z. z8 E9 W% f* T
6 y' J) g! g s
- l3 d& y6 w9 F' W average_turnaround_time += turnaround_time;
! M% M: T; `& e P$ B average_power_turnaround_time += power_turnaround_time;- f- O1 n! A' ?. F; I9 Z0 h
' [4 }- `7 f, I, i( m
return true;
@! `# q2 [& ~6 L) C" D. }' l }$ g" t3 P' H8 G$ ]
, q6 \7 ]! W' w# A/ n J
static inline bool printJobData(const JCB jcb, bool isMul)% z: t$ Q1 z! d" Z) p# x! n; I
{; o7 c4 ]! |6 l; x
TimeSlice turnaround_time = jcb.finish_time - jcb.submit_time;0 J) E4 N, x Q8 _0 r
double power_turnaround_time = turnaround_time / (jcb.required_running_time / 1.0);; u" H' \3 H/ E" S( b
, w1 s1 t* Y O! c" S
std::cout << "[Data] " << jcb.job_name << " "9 m; c3 e7 d% x+ ` B
<< " Finish time: " << jcb.finish_time << " "
& _4 }) c2 s7 A) ? << " Turnaround time: " << turnaround_time << " "
" E- e% j* L3 X9 o% q* Z << " Power turnaround time: " << std::setprecision(2) << power_turnaround_time << std::endl;
: K" E) ^- E, W* D3 Z& L8 y' z1 n4 [, L
6 ~% q0 P% T8 Z% {! @. S5 b% I- s
average_turnaround_time += turnaround_time;+ |$ z# L q. ^
average_power_turnaround_time += power_turnaround_time;
5 ^7 s9 h' }7 C$ a" Z, s# S/ x5 l+ y8 d, p. O
return true;2 N8 G9 H4 g* F+ |
}
& j8 D: F* R( d" a9 o4 Y};
3 W! v! L( X' A5 o' x5 i/ A! g% ?/ z% \2 |% e
class SchedulingAlgorithm8 X6 Q! t5 g9 c2 ~$ v1 R
{
3 Y( m; O7 U: \3 L! V$ ]0 {+ Vpublic:
+ [6 n7 Q0 Z3 [$ ]3 S
" G" v5 y/ d; G4 v" z" `9 |// virtual bool initPCB(std::priority_queue<JCB, std::vector<JCB>, std::less<JCB>> * ready_queue, int process_num) = 0;; ^. ?+ d# A; q3 h/ [! R" i
// virtual bool processPCB(JCB & pcb) = 0;
$ l4 f+ _# `/ w( k h% A8 e- a! N5 I};
, u3 x7 f! V! O4 L+ X' U5 c, _4 M, ^4 {( c( ?' _
// First-Come First-Served0 N$ b: t8 u5 g5 b3 u
class FCFSSchedulingAlgorithm : public SchedulingAlgorithm& s. Q+ J! l( [. }
{
6 Q; k1 W4 n+ K: y6 q" spublic:- W1 a* Q, n \0 a+ A7 F) {
struct PriorityCmp
& k7 @: z+ s$ s1 Y5 r6 s {2 f( J, A$ T- x0 k4 U
bool operator()(const JCB j1, const JCB j2)
4 s! A/ L2 f; \$ E; @ {
; F) v" r8 d/ M7 H return j1.submit_time > j2.submit_time;
" U: T& O3 w; R, P" P5 L }( Y" D0 C- p' I* N n7 M8 @9 h
};6 H: y# T# X5 [" F6 U5 ^- U
h- _+ |2 I- `. l, n
FCFSSchedulingAlgorithm()
* R+ v7 e4 [9 L- Q9 Y, Z) z {}2 a' k* P- h2 D. H8 V
8 z( ^3 T: H v( P. W* S) ?
private:
* \1 ]8 g# @% S8 z! D7 W) g; w
8 t& {2 `8 t3 d: C" {$ z& L$ [4 z; {' j z H( m
};. W8 W# m) v+ v+ j& ]
/ t U9 |8 j' r
// Short Job First4 d: N# u8 W" N0 }/ l; s* s
class SJFSchedulingAlgorithm : public SchedulingAlgorithm2 j" E1 o7 d; n4 u
{. B% a/ `3 t% F
public:
" Y; @8 p g; J8 z% F6 ~# M struct PriorityCmp
& s! F3 I5 @: z {
6 n1 {1 b" E. Y bool operator()(const JCB j1, const JCB j2)
0 _" z- m5 V+ D {# p6 S: G7 p3 D9 b6 x) C! g
return j1.required_running_time > j2.required_running_time;
v7 J9 X# S' D, r* I }
$ t" Z, a$ k& d };
0 d* l% h- r! _% x8 j$ P: g( H. r7 P
SJFSchedulingAlgorithm()
. p8 I$ e5 C" }% U1 u" U9 o* Q {}
* f" M7 _* U6 c* u' f. n. [
# C3 J% Q- b! h+ @& ~};
7 k$ A& K+ {7 z) e- k# y" {; ]6 W8 V* h+ m" [
// Highest Response Ratio Next" D* x! K; _0 Z" n9 z9 `
class HRRNSchedulingAlgorithm : public SchedulingAlgorithm
/ \; T, o. }9 j2 h{0 w( T. p5 Q, n# @5 T
public:6 O/ l" T! r, e
struct PriorityCmp
$ `0 o8 ~7 l, w% S2 ^" M {
2 A* U4 z8 n. ?6 e% `" R double getPriority(JCB jcb)
8 M; ~9 P1 H4 G5 L, f$ u {2 Z: U: V% }( w d9 q
return ((cur_time - jcb.submit_time) + jcb.required_running_time) / jcb.required_running_time;
3 T7 t* B" K. y4 B/ Y6 m }1 R$ \1 W+ a1 |: ?4 Y4 \: e
3 C( v8 p& g4 W$ l. ~* X, d1 U+ R; r bool operator()(const JCB j1, const JCB j2)) ? j2 v8 q- E6 O/ Q. [# n# c8 a; {
{
; \6 S* n5 O2 }7 g( \ return getPriority(j1) > getPriority(j2);
5 Y3 t) Z0 K4 a: y& F. q }
" b. m3 V8 I. ~# C* k: M( U };
: l) r! Q: L- F- j) a$ `2 e" H! L) O. Y
HRRNSchedulingAlgorithm()
) L e! G- D9 d6 r0 U+ k3 } {}- U# r; s# a4 _& `. Z& ~ P
};$ @; j2 }# X6 A& v' t+ l0 v
, P2 i% R3 E9 Y+ g; R3 q- _
template<typename PriorityCmp>$ G6 C9 X# @, k6 E
class JobScheduling! D: p* h$ Y9 b. a! s1 s" Y
{
+ Q$ i( `, u0 j+ v7 {3 o$ ?8 u, \8 w5 vpublic:8 {/ P" A l0 J) E# a q5 l
JobScheduling(int job_num)
6 o, D5 q6 K/ b' d1 s% L {5 g0 Y% q9 o' z. B- ]" k. r! p- L- k7 ]+ J
job_num_ = job_num;, t/ h# ]0 y: _) A2 l9 Y
sa_ = new SchedulingAlgorithm();
2 K3 V! j8 R& l& J& z& n' W wait_queue_ = new std::priority_queue<JCB, std::vector<JCB>, PriorityCmp>();- p1 C. H0 ^) a6 o
mock_jcbs_ = new std::priority_queue<JCB, std::vector<JCB>, PriorityCmpForMock>();
& M z& L& l; g# e1 P9 I# @" Z finish_queue_ = new std::queue<JCB>();# |" W+ V! N! R/ B2 H- S2 j# g
1 W+ x$ Y5 _0 g8 b* P9 K
mockJCBs();# b: L4 ]' q$ M! d+ d* |' U6 N( h& E8 A
}
9 w" P7 x9 {& t/ h8 v! e/ Z" L% B/ f- T5 R
protected:' S& _+ H6 {, {
struct PriorityCmpForMock. z* m: c4 ^7 w
{2 u4 S% O( v0 \% X$ v: c7 g, N3 l
bool operator()(const JCB j1, const JCB j2)/ @. [7 c A* r; q0 y
{& c& _2 q# Z. a
return j1.submit_time > j2.submit_time;
6 |! b1 {" m4 z }8 [2 x$ N. K7 [
};- }' O. W9 m1 L9 F3 V+ w3 Q
* y' n6 y) u' g6 @& \
bool mockJCBs()
% m3 h5 ]0 x+ C8 j4 W! j5 D9 j {
) }# z0 R8 r, p5 N8 J3 {3 p+ I for (int i = 0; i < job_num_; ++i)
; ~( r3 O3 z7 \6 |9 w {2 e- R2 h8 b- Y9 u! F# ~' p& H
JCBptr jcb = new JCB();
' p8 w8 e- k9 N jcb->job_name = "job" + std::to_string(i);
/ ]1 J0 A2 p* y jcb->job_status = Wait;% u) T3 N" g$ N5 D# L
jcb->submit_time = Util::getRandom(1, 20, i);& t: Y# L( V d: i" Q
// The minimum value is 3 so that each segment can be divided into time slice, F: `+ a h& Q7 L! D/ h
jcb->required_running_time = Util::getRandom(3, 10, i);
2 u9 v$ U# a, ^, x0 K6 z
( p4 k' B1 l0 a2 m& w mock_jcbs_->push(*jcb);0 U4 g" q: k6 q# r1 @
std::cout << "[INFO] finish init " << jcb->job_name << " with "
* \3 V0 Y6 J1 Q* {1 l3 T% Q, @2 Z, v << " submit_time " << jcb->submit_time! `- z( d8 q F8 T7 C
<< " required_running_time " << jcb->required_running_time << std::endl;
1 f6 S! C& Y* c$ m }. Z- A F2 i4 Q
}
. |6 R: Y- A3 y" s+ m3 X, ?" S6 ?! p, Y
void getCurrentReadyQueue()
0 Q1 `& v. ?- P' e) l& q$ [ {
. V: K3 @( n2 C2 m- P while (!wait_queue_->empty())% g8 L" W% q- q# c! ]) n. F2 V
{) e2 Y9 i, m% k. J# S, F5 j
JCB jcb = wait_queue_->top();0 p! _* G& j. d" }- X8 ^' s7 \
std::cout << jcb.submit_time << std::endl;" F9 P0 |; Y5 a' L, q
wait_queue_->pop();/ i. F0 Z7 z3 C: r' m6 ]* s" e- y
} b' [3 x- C3 P. I/ }2 N; Q
}) _2 n% Y5 p7 ^' H4 s+ H
; A D! j6 F% }6 r6 I# L$ s$ s
int job_num_;% o% V& l9 }% t" n1 }6 u2 d
SchedulingAlgorithm* sa_;+ n& L( @9 s3 K1 ?; b2 ^4 m
std::priority_queue<JCB, std::vector<JCB>, PriorityCmpForMock>* mock_jcbs_;
9 X8 e! {3 r1 Q! {. ]+ z std::priority_queue<JCB, std::vector<JCB>, PriorityCmp>* wait_queue_;
: F5 I: h3 @* _5 i( `0 p std::queue<JCB>* finish_queue_;
% D/ F; z+ s6 Z7 U4 @7 v};0 M- \' G2 d7 |" i% ]& l
$ D X# N3 Q% s3 @5 M9 ^
template<typename SchedulingAlgorithm, typename PriorityCmp>
, x2 ]; F ~" a; Iclass SimpleBatchProcessingSystemJobScheduling : JobScheduling<PriorityCmp>
4 S( m% F8 `% ]; K5 F" }2 E{) C$ T& u0 I' P D3 }
public:2 J2 J+ C5 m( |
SimpleBatchProcessingSystemJobScheduling(int job_num)
; W" J+ ~: a1 N) e i4 [; ?) t$ M : JobScheduling<PriorityCmp>(job_num)& H9 l, m( X2 u9 m
{}
# O9 K# d/ R/ a; z
9 ^9 Q) w" q- O: W bool start()0 L0 A& u7 X6 M# C
{
8 w/ p- S/ p/ q# `0 ]* ~/ l cur_time = this->mock_jcbs_->top().submit_time;: Y% }! {, c! u2 [& X! @/ W
while (!this->wait_queue_->empty() || !this->mock_jcbs_->empty())
9 p6 d4 `- n8 p( D2 X, z {
6 \/ u" b. d9 T! b: O G' \8 r // Simulate adding tasks dynamically
+ y p5 \4 E U9 A$ ^; _' E if (!this->mock_jcbs_->empty() && this->mock_jcbs_->top().submit_time <= cur_time)/ H4 W8 N8 [5 k8 I. x' Q5 I
{
0 x1 G% T0 ~4 a- n8 `$ R JCB jcb = this->mock_jcbs_->top();! U9 j; m4 W2 T7 g
this->mock_jcbs_->pop();
( c, ~$ O7 q0 E+ j" e! Q! k: b) b
std::cout << "[INFO] add " << jcb.job_name << " to wait queue." << std::endl;; Y$ c$ ]- f* E; a6 [
this->wait_queue_->push(jcb);1 Z4 A. ?# r6 Q8 D
}
+ D- x9 e, _8 _' U6 d
8 X0 w2 m3 a# m if (!this->wait_queue_->empty())
. W$ _1 s4 m# _" i }1 E, z {
' q8 g8 X5 r {3 M5 l' F1 t' U* E JCB jcb = this->wait_queue_->top();# G: r- q; y' I2 I5 w
this->wait_queue_->pop();
; S9 [2 y# p0 C- _ h9 L* B8 w7 U- I: k1 b4 B4 i, O% m
std::cout << "[INFO] begin to do " << jcb.job_name << "." << std::endl;
6 A, y- \& _8 L) v z jcb.job_status = Run;
! ]! I$ u$ t: ]8 U' R8 V // simulation do job1 r( l: H6 g/ Y* N/ R
sleep(1);7 d9 I- X$ T3 N k# E8 W
std::cout << "[INFO] do " << jcb.job_name << " finish." << std::endl;
* V0 ^0 r* ]' F5 o5 g5 A% n; h# o5 Z
jcb.job_status = Finish;4 D! h4 r' p8 [5 Z" O
// print job Data.
) u- c: `% U8 n3 [+ w( o Util::printJobData(jcb);
3 a- r4 I% G# z this->finish_queue_->push(jcb);" p2 O4 P+ J ]5 @; P% X2 y
cur_time += jcb.required_running_time;7 D/ m) k5 C, u H
} f; Y9 s* Z2 b
else. U3 \$ C: b) O6 e
{3 F+ j6 O$ D" {4 ]4 f1 h
// Slowly increase time slice when there is no job
$ S1 o! Y9 q, K; j- M4 [ cur_time += 1;
$ Q6 ?8 x% R( `, q8 n+ q+ ?! G }
( X4 A. r* ?' |2 z0 H }
( u7 `# B7 [" h, [/ { std::cout << "[INFO] all jobs finished." << std::endl;
6 q ]$ c R _7 q( F0 J std::cout << "[LOG] average turnaround time " << (average_turnaround_time / this->job_num_); V. |& b6 F; c! ?- R
<< " average power turnaround time " << (average_power_turnaround_time / this->job_num_) << std::endl;
, Y& V3 S4 h: b2 r0 @9 J }+ b$ _: g) n: z8 C) q7 E
# |7 J' z& |2 S# f6 s
private:2 ?+ [8 H4 [1 v8 o' _( y$ r
: h& D+ `8 j5 b3 B; q5 k};0 `5 k3 X3 n* a, ~& Y
: x3 c& ?/ K& M2 I _0 z6 b
' T/ r4 W- P5 A k* \0 c9 k, g. Iclass MultiprogrammedBatchProcessingSystemJobScheduling7 R$ z: z. ~4 d T
{
% r6 A2 \: ?% ?, P3 S! ]5 ^. r& Zpublic:
" T* n, N# T7 y; u struct PriorityCmpForPCB2 @0 S n, m2 Y9 Z' \2 I1 I
{+ R( v: z, {$ N# r7 W0 I. ^- s
bool operator()(const PCBptr p1, const PCBptr p2)
; w1 w7 C9 _8 J {
7 o* e, ^( ]% ~% _. y- @5 G return p1->priority < p2->priority;
- O* h$ i$ x& S7 z7 t }& ?0 E7 ~; T. ^2 e
};
! m- ?- D: e/ M6 Y0 I. L b
4 q, s4 B, j8 s+ L* t1 P struct PriorityCmpForBack
+ i; l/ d" C: j! J3 ^ {
, B' a' X* Y' Y% J; H; } bool operator()(const JCBptr j1, const JCBptr j2)0 Q( [$ Y3 l! q$ Y* t* \0 B# D
{+ [0 j) j$ q1 k0 a! N6 |2 ?+ w
return j1->submit_time > j2->submit_time;* S) @/ E3 g4 b: o9 X
}# u; m7 g; { Q: \7 _! y
};
7 a5 R0 e, H: X, n6 M3 ^) G/ ^! T/ t0 N4 S( k( ]: X
5 B, ]" o+ ?: g+ n1 ` MultiprogrammedBatchProcessingSystemJobScheduling()
# s1 N4 z6 M# ?2 q0 x9 c( p! z {9 V4 ~' E, S' t
back_queue_ = new std::priority_queue<JCBptr, std::vector<JCBptr>, PriorityCmpForBack>();) |. M( ?/ k- J; D' Z
psa_ready_queue_ = new std::priority_queue<PCBptr, std::vector<PCBptr>, PriorityCmpForPCB>();
( y+ z8 W* r U' G4 n6 d6 y0 z; K j4 q h
' |, ^- o% ], ]2 Q
std::cout << "input job num:" << std::endl;2 n! I1 a) ]! }( o) w2 R; F; h
std::cin >> job_num_;/ |; v1 l% b- C" o. o4 S' {
for (int i = 0; i < job_num_; i++)
2 v ]; i3 P+ q {
' H; H: I0 m1 f2 `# S std::cout << "input job" << i << " submit_time & required_running_time & priority" << std::endl;1 h7 t& e' R" a, v: b5 [2 J
! D" w: h! ~/ p9 A9 O- u JCBptr jcb = new JCB();& s: u1 h- ^1 I l( }/ a
jcb->job_name = "job" + std::to_string(i);
( I Q4 G7 }) T0 A( O jcb->job_status = Wait;
. ~- @: c- j% j6 j( z std::cin >> jcb->submit_time;8 m4 q6 w, L% U. @) |) j! g
std::cin >> jcb->required_running_time;
' t2 ]/ D- L s% | A: @ std::cin >> jcb->pcb->priority;
4 E( c/ d0 d% e0 k back_queue_->push(jcb);/ P: w1 K: h! y" Y* Z$ e; L
}1 G6 ~5 `+ I. p8 H3 n$ `
7 x3 L' B3 A( v% \/ v% d$ Q+ {6 W% i /*3 {% c+ P# E# Z% m5 H2 C
job_num_ = 6;4 ?$ W) O- [6 P3 B3 V7 {
5 E/ i, i; `# Y$ d# Q JCBptr jcb = new JCB();
; H* {" t! @# i& G% b! u5 H jcb->job_name = "A";
% B$ I: Z- q4 {/ O jcb->job_status = Wait; M0 ]1 {1 b9 e, L3 v9 S, [( s
jcb->submit_time = 0;
: d% f. ~. n* V4 [& l5 ^/ l! R, l$ S jcb->required_running_time = 50;" Z9 L( q q; c8 t j$ s
jcb->pcb->priority = 5;2 s* o. |3 G- i1 @& i
back_queue_->push(jcb);$ V! t7 T) Q3 ^/ u8 G: I. T
+ p; N6 `/ y/ ?8 R! e jcb = new JCB();' X& O4 j' O9 T* r' U
jcb->job_name = "B";
. T& F5 l% J5 X6 G+ ^: _% w jcb->job_status = Wait;
7 X6 Q. b/ k& b jcb->submit_time = 20;( _# y1 P$ F( B3 Y* [; e- R
jcb->required_running_time = 60;
. C* Y3 j" F" W/ N( ~& Q- ` jcb->pcb->priority = 7;/ e' _$ Y5 C' B5 z$ j2 v
back_queue_->push(jcb);/ H2 h$ T" n1 ^4 }9 d
5 W( M; e, q0 c
jcb = new JCB();; A, R2 v1 P1 V$ r! b
jcb->job_name = "C";/ Y% @ R7 X2 ~* B1 V# {! ]1 g# ?1 T
jcb->job_status = Wait;
/ }5 {8 a0 m6 s jcb->submit_time = 50;0 Q: r# R; F% r" e# L4 E6 f
jcb->required_running_time = 40;* q0 d& v* W) L, J! Z
jcb->pcb->priority = 3;+ i9 Z$ Q9 p# r
back_queue_->push(jcb);
' M; W6 M: `6 P
& T, _( l: X7 l. Y% G jcb = new JCB();( O. r5 E) s& A$ w9 M
jcb->job_name = "D";
% K* R! L# k; K/ Q- Y- k jcb->job_status = Wait;
/ |7 b7 S5 g- h: h6 A7 X: |: j jcb->submit_time = 80;
; j1 S5 {# n) R& Z I# a/ C! r jcb->required_running_time = 80;
$ I" }) s4 O6 [$ a7 e8 S% t2 p2 X: \ jcb->pcb->priority = 8;
6 L- e6 W" Q! Z8 Z back_queue_->push(jcb);
0 t" ~- ?9 B, b M8 p
6 W6 w- E- ?/ O( I. ` jcb = new JCB();
- {- C T: W4 B7 i jcb->job_name = "E";
' y8 k4 _) p# b4 S6 g jcb->job_status = Wait;
, s5 H5 t: s- Q4 B7 } jcb->submit_time = 100;! K: }( X! O! T# i1 @
jcb->required_running_time = 30;
8 A% o* S- s+ j; ]5 o jcb->pcb->priority = 6;( j+ L5 j4 _0 @
back_queue_->push(jcb);5 l' h( Z2 j" _. H, y
1 l4 C- V( _" t jcb = new JCB();
z$ ?' K5 [: Q4 d jcb->job_name = "F";
0 p2 n5 \) W' L4 v jcb->job_status = Wait;
$ X3 O3 A0 e2 |# w" Z8 w' l jcb->submit_time = 120;
" W6 ~/ z2 B( q9 M jcb->required_running_time = 70;. K: Q7 n5 ?3 n0 X& P; {
jcb->pcb->priority = 9;! {! l5 |4 F# B9 q$ ]* j
back_queue_->push(jcb);
0 i' J1 E$ A: V1 Z4 [! t( ` */
+ U+ d3 \/ N3 \7 n. e8 ^ }! u+ y1 F8 i2 w: V/ l* r. b
* s$ G; J B7 t5 t/ E/ P
bool start()
5 E5 P& }/ t- |% U- K {
3 d* y M* a2 `' r8 \ cur_time = back_queue_->top()->submit_time;
' ]9 t6 Q* s8 Z while (!back_queue_->empty() || !psa_ready_queue_->empty())
# E7 @) g* e0 g% ?" B3 Z: E) f" W& h {4 Z0 j. X7 q4 }! l( c
bool increase_time = true;* _6 z0 ]& V- U' M, w% E: B4 r
// Job FCFS2 I8 J. ^& a" H' q6 y) t: @ i V
if(!back_queue_->empty() && psa_ready_queue_->size() < 2)% M' M; u# k U& \9 n2 ^
{9 M ^2 ^! ^! {3 W2 P. v
JCBptr jcb = back_queue_->top();
2 q* u2 W# n* s1 d" I if (jcb->submit_time <= cur_time)
' L0 E( n/ [* J( F {4 G2 c) `9 b2 Z( ~$ `% e% R, w- J
back_queue_->pop();5 Y: L2 Y8 U8 A9 j4 R
) o% N- S, k* V
// Process PSA
0 k1 P1 T7 T" k& G& m; c if (!psa_ready_queue_->empty()). D; L9 ?: {( d$ y. L- A! }
{, t1 S! e' F7 A
PCBptr pcb = psa_ready_queue_->top();
. \5 S& v, r2 f/ T, _2 W JCBptr jcb = pcb->jcb;9 X. O8 i4 J) F3 E
" ]2 L5 h, f( p. w if (jcb->already_run_time >= jcb->required_running_time)/ b: D' C1 R! U: ~! L
{
# Z) g, C) J0 v& e jcb->job_status = Finish;3 L* @: f: m6 b6 ]% R
psa_ready_queue_->pop();& } z5 r8 z5 c( i1 s9 b0 y
//std::cout << "[LOG]" << jcb->job_name << " Finish At " << cur_time << std::endl;
- e. J2 O# n2 b+ y7 V, b- ? w; W/ g" `# W x
jcb->finish_time = cur_time;
1 j% f: ~! |- d( V Util::printJobData(*jcb, true);2 M8 v1 o2 k# u2 J+ s% q
}) `! {& ?0 H4 |, W* X' ~
else
: L9 |7 ~' E$ j) v: u% t {
/ `; {1 k6 e6 w8 C/ z9 K& t jcb->job_status = Wait;
; D0 ?7 b# D( U* T5 L& `$ c6 q pcb->status = Ready;
$ ]: T% z5 o0 M# T //std::cout << "[LOG]" << jcb->job_name << " Ready At " << cur_time << std::endl;6 v2 M" g* _' F0 N$ J
}, j9 m9 Y# M7 e# O% Y, a' e
}
. e, F) ^) f- v$ P# g) G/ M+ C- S! F* y
psa_ready_queue_->push(jcb->pcb);
8 u. x8 Y( O, Q/ d9 u; M, C- |
& z( b# ?/ _# ^# z0 p. r PCBptr pcb = psa_ready_queue_->top();
) Y/ r2 y; ]) T9 z) p' | a JCBptr jcb = pcb->jcb;; ^, q1 E! c+ R( `3 k3 [/ x, }
jcb->job_status = Run;5 J% j& F T: i4 D' E3 y
pcb->status = Running;
/ q6 q2 f$ ?* @/ I- q! G7 u! i" q
6 R. H$ s6 Z5 K //jcb->start_time = (jcb->start_time == -1) ? cur_time : jcb->start_time;
$ A* I7 {9 `/ r3 F- n9 Y+ j //std::cout << "[LOG]" << jcb->job_name << " Begin Running At " << cur_time << std::endl;
% k9 C) t d- G1 m7 }1 I! F: i
increase_time = false;
" J# G: {: v: Q, Z9 d/ h }- p0 Z/ k2 y( k1 v
}
+ w" t0 c+ S; b/ l& M, p! J! M else if (!psa_ready_queue_->empty())" F* ^5 j+ p. G
{
8 b1 n- t) V1 z, I) ? PCBptr pcb = psa_ready_queue_->top();
/ x7 O0 h4 n h) e7 F. ?0 ~ JCBptr jcb = pcb->jcb;
: }/ d, }" a# r( M# p" X, T2 j! n8 V6 C: v
if (jcb->already_run_time >= jcb->required_running_time)/ m& x- h- _/ W' `+ N1 u
{
. G0 \# V1 X% k5 x6 C% Q9 y jcb->job_status = Finish;/ o/ o4 v, X& o* i9 c, a" [' e. m
psa_ready_queue_->pop();
' b: L d e- X5 l- \+ b) K& G/ d0 P //std::cout << "[LOG]" << jcb->job_name << " Finish At " << cur_time << std::endl;
+ w0 k# ~3 Z3 h( l. i) z# w jcb->finish_time = cur_time;; ^$ ]% [* s: Z. U' A6 N# Q, ?
increase_time = false;
5 P: n! n$ Y1 b/ O( w: k& N
, _# Y, x7 s% N# u1 m JCBptr jtop = psa_ready_queue_->top()->jcb;6 h6 o( O* l; D) e# G
//jtop->start_time = (jtop->start_time == -1) ? cur_time : jtop->start_time;5 P) N# k9 Z/ |3 m( F) {
Util::printJobData(*jcb, true);
* {1 W0 y8 W( z* Z4 S }# f6 s r! I& {: i9 [/ t- I4 V. ~( K) {- k8 z
}* n8 r* T6 M; e. m
7 K. Z4 ~' O: [2 @- n if (increase_time)8 ?8 E. B. u' @. U& u6 c
{
( N9 l/ W- X1 m: {4 j if (!psa_ready_queue_->empty())
& M7 B3 d3 i' ~ {! I. i0 C' O0 ] q* V( `! H: x1 y+ L
PCBptr pcb = psa_ready_queue_->top();
- `3 l! d5 n$ G pcb->jcb->already_run_time++;
' A/ M/ i, r; M. W) P }
* R) u: x$ y9 L& M, [9 P& g* F cur_time++;, G6 C0 M% E) G9 N! i3 ?$ s
}) |; F7 d! O0 M5 t( Q7 g3 n* Z
}
( @5 T% T9 X, P! b6 c std::cout << "[INFO] all jobs finished." << std::endl;: D& G6 G5 S8 B Y' [7 |
std::cout << "[LOG] average turnaround time " << (average_turnaround_time / job_num_)
* H2 E9 {/ `4 t << " average power turnaround time " << (average_power_turnaround_time / job_num_) << std::endl;4 Z, @( I& @# J) c
}' t/ K e- V1 T0 K
" V# l1 e; R: [6 b% p7 [2 C' nprivate:7 p! T: K" M. g
int job_num_;
' R# o( m4 B( ~ std::priority_queue<JCBptr, std::vector<JCBptr>, PriorityCmpForBack>* back_queue_;
: R& X+ ~: e# W$ j" h std::priority_queue<PCBptr, std::vector<PCBptr>, PriorityCmpForPCB>* psa_ready_queue_;0 |& R9 }& }$ z; K B. A3 \( `
};+ j5 b p! H& l* ^5 `+ |' P2 I
# v6 z0 [2 W8 G; s
/*$ L) ~8 ^3 d5 L% @' v% C$ ]# m. q( v
int main()
0 A+ G m0 O( [1 ?: c3 Y{. v' n& \8 `4 C& M
SimpleBatchProcessingSystemJobScheduling<FCFSSchedulingAlgorithm> js(4);
1 |. I! F0 k7 c* ]! H0 v! i js.getCurrentReadyQueue();
+ @+ r1 ]- i! X, [8 T1 t) d! E7 J. l- `: B. w
// pause to see result2 b# k* s" W8 X L# S1 j( ]
getchar();: r9 T& w/ v4 ]* g5 I; G
return 0;
2 d! w4 K* B+ c8 M; O}
2 Z: W. z0 b! t! v9 `*/; e" f' `1 A, t3 A% h0 o- E/ V- T
* I5 h* i" N. H六、运行结果
& d. }7 i; Q+ I0 r) }6.1 单道批处理(FCFS)
: @' z+ {$ O- V0 U2 o! Q
9 K; z0 W8 A0 X8 r' b
. `+ ?$ s& L Q* ]( `- F6.2 单道批处理(SJF)( I% C# b0 h- \" [9 g6 P
1 @) }8 t$ ^: X9 T" r3 S
: H4 z4 ~) z# b6.3 单道批处理(HRRN). M \( }; C. c
+ M. c, I9 v# D$ t2 p1 M* S( g8 V- w6 Z# ^* |% ^
6.4 多道批处理(FCFS + PSA)) W7 V, A5 a, E' i
! l$ @7 E; y7 P t6 m
- }- y4 y$ D- Z" S! Y# g七、结尾8 u% l* m; g7 g6 {
如果本文描述的内容或使用的代码存在任何问题,请及时联系我或在本篇文章的下面进行评论,我会本着对每一位学技术同学的负责态度立即修改。在后续还会有三篇计算机操作系统的算法 C++ 复现博文,如果感兴趣可以关注我。( }5 P- b( v2 i' O3 o5 g# j
————————————————
% C9 c0 G+ _: m, F* s版权声明:本文为CSDN博主「杨小帆_」的原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接及本声明。
! [- g( [ f6 p z8 J原文链接:https://blog.csdn.net/qq_40697071/article/details/106698130
% l: b) R/ J5 X0 c& l; P" A8 v0 v* G$ S2 i& W. w3 B3 a' A( F1 Z) J
1 u8 |0 F; e5 e6 h2 L4 V; e
|
zan
|