Saturday, January 16, 2010

Process Scheduling Algorithm

Compute the Average Turn Around Time of the following process scheduling algorithm.

 

Arrival Time: 0   1   2   3   4   5   6   7   8   9   10

Job Name:     A   B   C   D   E   F   G   H   I   J   K

CPU Cycle:    5    2   8   4   3    1     2   9   7   3   4

Time Quantum: 2

ANSWERS:

a.       a. FCFS

Job A

Job B

Job C

Job D

Job E

Job F

Job G

Job H

Job I

Job J

Job K

0-5

7

15

19

22

23

25

34

41

44

48

 

ATT = 5+7+15+19+22+23+25+34+41+44+48 = 25.73

                                      11

 

b.     b.  SJN

Job F

Job B

Job G

Job E

Job J

Job D

Job K

Job A

Job I

Job C

Job H

0-1

3

5

8

11

15

19

24

31

39

48

 

ATT = 1+3+5+8+11+15+19+24+31+39+48 = 18.55

                                     11

c. SRT

Job A

Job B

Job C

Job D

Job F

Job G

Job E

Job H

Job  I

Job  J

Job A

Job K

Job  I

Job C

Job  H

0-1

3

4

8

9

11

13

14

15

18

22

26

32

39

47

 

ATT = 22+2+2+5+9+5+5+40+24+9+16 = 12.64

       11

d. Round Robin

Job A

Job B

Job C

Job D

Job E

Job F

Job G

Job H

Job I

Job J

Job K

Job A

Job C

Job D

Job E

Job H

Job I

0-2

4

6

8

10

11

13

15

17

19

21

23

25

27

28

30

32

 

Job J

Job K

Job A

Job C

Job H

Job I

Job C

Job H

Job I

Job H

33

35

36

38

40

42

44

46

47

48

 

           ATT = 36+3+42+24+24+6+7+41+39+24+25  = 24.64

                                                        11

Friday, January 15, 2010

Exercise 1

1.        Given the following information:

 

 

 

Job List:

 

 

 

                Job Number                            Memory Requested

 

               

 

                      J1                                                       700k

 

                      J2                                                       500k

 

                      J3                                                       740k

 

 

 

Memory List:

 

 

 

                Memory Block                                       Size

 

 

 

                Block 1                                                    610k

 

                Block 2                                                    850k

 

                Block 3                                                    700k

 

 

 

 

 

 

 

 

 

 

 

A.       Use the best-fit algorithm to allocate the memory blocks

 

to three arriving jobs.

 

Memory Block

Memory  Block Size

Job Number

Job Size

Status

Internal Fragmentation

Block 1

650K

J2

500K

Busy

150K

Block 2

850K

J1

740K

Busy

110K

Block 3

700K

J3

700

Busy

0

Total Available:

2200K

Total Used:

1940K

Busy

260K

 

 

 

B.       Use the first-fit algorithm to allocate the memory blocks

 

to three arriving jobs.

 

 

Memory Block

Memory  Block Size

Job Number

Job Size

Status

Internal Fragmentation

Block 1

650K

J2

500K

Busy

150K

Block 2

850K

J1

740K

Busy

110K

Block 3

700K

J3

700

Busy

0

Total Available:

2200K

Total Used:

1940K

Busy

260K