1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

#coding=utf-8

import

__main__

import

string

def

fcfs

(

come_time

,

run_b_t

,

run_e_t

,

run_t

,

order

):

#

先來(lái)先服務(wù)

time_temp

=

come_time

[

0

]

for

i

in

range

(

n

):

run_b_t

[

i

]=

time_temp

run_e_t

[

i

]=

run_b_t

[

i

]+

run_t

[

i

]

time_temp

=

run_e_t

[

i

]

n_schedul

=

i

order

[

n_schedul

]=

i

+

1

return

come_time

,

run_b_t

,

run_e_t

,

run_t

,

order

def

ps

(

come_time

,

run_b_t

,

run_e_t

,

run_t

,

order

,

_prio

,

run_f

):

#

優(yōu)先級(jí)

調(diào)度

i

=

0

max_priority

=

_prio

[

i

]

j

=

1

while

j

<

n

and

come_time

[

i

]==

come_time

[

j

]:

if

_prio

[

j

]>

_prio

[

i

]:

max_priority

=

_prio

[

j

]

i

=

j

j

+=

1

#

查找第一個(gè)被調(diào)度的進(jìn)程對(duì)第一個(gè)被調(diào)度的進(jìn)程求相應(yīng)的參數(shù)

n_schedul

=

i

run_b_t

[

n_schedul

]=

come_time

[

n_schedul

]

run_e_t

[

n_schedul

]=

run_b_t

[

n_schedul

]+

run_t

[

n_schedul

]

run_f

[

n_schedul

]=

1

temp_time

=

run_e_t

[

n_schedul

]

order

[

n_schedul

]=

1

temp_n

=

1

while

temp_n

<

n

:

max_priority

=

0

for

j

in

range

(

n

):

if

come_time

[

j

]<=

temp_time

and

run_f

[

j

]==

0

:

if

_prio

[

j

]>

max_priority

:

max_priority

=

_prio

[

j

]

n_schedul

=

j

#

查找下一個(gè)被調(diào)度的進(jìn)程

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來(lái)咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的python适用的操作系统是_操作系统先来先服务python的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。