pop up description layer
Last modified: 20100915:102940/update banker.in data and change due date

FIT2022 AJH-2010-36

Assignment 2: Deadlock and Paging

Objectives | The Banker's algorithm | Page Replacement | Any Questions? | Submitting your Work | Use of SVN

Due Date: 04 Oct 2010, at 12noon

1. Objectives

The objectives of this assignment are to:

  1. develop skills in applying the Banker's algorithm; and
  2. model a range of page replacement algorithms

2. The Banker's algorithm

Consider the following system snapshot, with resources A, B, C and D and processes P0 to P4:

Max Allocation Need Available
A B C D A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2
P1 2 7 5 0 2 0 0 0
P2 6 6 5 6 0 0 3 4
P3 4 3 5 6 2 3 5 4
P4 0 6 5 2 0 3 3 2
2 1 0 0

This data is available for download here:

"banker.in" 2.1 =
resources=['A','B','C','D'] processes=['P0','P1','P2','P3','P4'] Available={'A':2,'B':1,'C':0,'D':0} Max={'P0':{'A':0,'B':0,'C':1,'D':2}, 'P1':{'A':2,'B':7,'C':5,'D':0}, 'P2':{'A':6,'B':6,'C':5,'D':6}, 'P3':{'A':4,'B':3,'C':5,'D':6}, 'P4':{'A':0,'B':6,'C':5,'D':2}, } Allocation={'P0':{'A':0,'B':0,'C':1,'D':2}, 'P1':{'A':2,'B':0,'C':0,'D':0}, 'P2':{'A':0,'B':0,'C':3,'D':4}, 'P3':{'A':2,'B':3,'C':5,'D':4}, 'P4':{'A':0,'B':3,'C':3,'D':2}, }

Code the Banker's algorithm as a python program banker.py, and use it to answer the following questions:

  1. How many resources of type A, B, C and D are there?
  2. Compute what resources each process might still request, and display them in the Need matrix.
  3. Is the system in a safe state? Why?
  4. Is the system currently deadlocked? Why?
  5. If a request from P2 arrives for additional resources of P2(0, 1, 0, 0), can the algorithm grant the request immediately? What state would the system be if the request if granted immediately? Which processes, if any, are or may become deadlocked if this whole request is granted immediately?
  6. Use your program to explore different requests, and define a request that will lead to the opposite state you found in part 5.
Write your solutions into a text file called 'banker.txt'. It should be structured so:

"banker.txt" 2.2 =
1. A=%d, B=%d, C=%d, D=%d 2. Need Matrix A B C D P0 %d %d %d %d P1 %d %d %d %d P2 %d %d %d %d P3 %d %d %d %d P4 %d %d %d %d 3. Yes/No. Because ... 4. Yes/No. Because ... 5. Yes/No. Safe/Unsafe P%d,P%d,... 6. Safe/Unsafe P%d(%d,%d,%d,%d)

All formatting items to be filled with appropriate values. Choose between Yes/No (print only one) and Safe/Unsafe. Complete the reason Because ...

3. Page Replacement

You are to write a Python program to model a range of page replacement algorithms. The program should be structured in such a way that each algorithm can be dynamically loaded and executed, to see the effect of using different algorithms on the same page reference string.

3.1 The Page Replacement Algorithms

3.1.1 The parent class PRA

Each page replacement algorithm shares a number of common methods. You are to write a superclass, PRA, contained in a file PRA.py, that has the following variables/methods (besides the usual initialization, etc..):

faults
the number of page faults that have occurred.
pageouts
the number of pages that have had to be written out
ref(p,w)
a reference to page number p is made. Returns the frame number f at which the page resides. If a page fault occurs, increment faults, and invoke the replace method. 'w' is the write bit, indicating that the page has been written since the copy on disk.
replace(p)
Find a frame f to remove, and replace it with p. If the frame f is dirty, increment the pageouts variable. Return f.

Each of the following algorithms must inherit from PRA.

3.1.2 First-In First-Out

The frame selected for removal is the oldest page amongst all those in main memory. Write a python class fifo (in a file called fifo.py) that inherits from PRA and implements first-in first-out.

3.1.3 Least Recently Used

The frame selected for removal is that frame that has not been referenced for the longest period. Write a python class lru (in a file called lru.py) that inherits from PRA and implements least recently used.

3.1.4 Least Intensively Used

The frame selected for removal is that frame that has had the fewest references (since being loaded) of all frames in memory. Use FIFO to break any ties. Write a python class liu (in a file called liu.py) that inherits from PRA and implements least intensively used.

3.2 The Main Program

Your main program is responsible for implementing all the tests required under section "Testing your Page Replacement Program" below. Arrange your main program to test both the given reference string, followed by at least two reference strings (with the same parameter) generated by the page reference generator, given in the next section.

A key aspect of your main program is that it must dynamically load the code for each of the three replacement algorithms. That is, they should not be statically included in the code for the main program, but rather, read in at run-time as a string (from the various files), and then evaled to define the appropriate class. The name of the file should be used to determine the class to instantiate.

The algorithms to test must be defined by a list, which (as an extension exercise) can be augmented to add other replacement algorithms if desired.

Your main program should therefore contain the following fragments (or similar - feel free to use eval/exec/execfile as appropriate, or to structure the body of the for loop in whatever way you wish - the only essential thing is that the replacement methods must be called dynamically, as per the # invoke the ref method dynamically line:

"paging.py" 3.1 =
algs=['fifo', 'lru', 'liu'] refstring=[3,4,6,8,7,5,1,3,1,5,6,0,4,5,2,7,4,3,2,7,0,3,3,6,3] framesizes=[3,4,5] # number of frames to test against algorithm algpgm={} ... for alg in algs: execfile(alg+'.py') # define the replacement class algpgm[alg]=eval(alg+'()') # instantiate the class ... for numframes in framesizes: # test algorithm on this many frames ... for p in refstring: ...algpgm[alg].ref(p,w) # invoke the ref method dynamically ... ...

3.3 Page Reference Generator

The following code is provided to assist you in your testing.

"pagerefgen.py" 3.2 =
#!/usr/bin/python import getopt import random import sys pages=12 length=12 def usage(): print """ pagerefgen.py [-f npages | --pages=npages] [-l nrefs | --length=nrefs] This program generates a random sequence of page numbers. The page numbers are drawn from a logical address space containing npages pages. The sequence will be of length nrefs. npages = the number of pages in the virtual address space nrefs = the total number of page references in the address string """ def generate(n,l): seq=[] for count in range(l): nextref=random.randint(0,n) seq.append(nextref) return seq if __name__ == '__main__': (vals,path)=getopt.getopt(sys.argv[1:],'p:l:', ['pages=','length=']) for (opt,val) in vals: if opt=='-p' or opt=='--pages': pages=int(val) if opt=='-l' or opt=='--length': length=int(val) if len(path)!=0: usage() sys.exit(1) seq=map(str,generate(pages,length)) for s in seq: print "%s" % s,

This program can either be used stand-alone to generate a string of page references, or imported into another python program to generate a list of page references. In the latter case, the usage is through calling the function generate(n,l), where n is the number of pages in the logical address space, and l is the length of the generated reference list.

3.4 Testing your Page Replacement Program

You should run your paging.py program with at least the following reference string on your three algorithms:

3 4 6 8 7 5 1 3 1 5 6 0 4 5 2 7 4 3 2 7 0 3 3 6 3

You should test your algorithms for memory sizes of 3,4,5 frames, and show the results in a text file replacement.txt. Comment on the differences in results in your discussion.

4. Any Questions?

If there is anything unclear, or something you think is needed is omitted, ask your question in the Moodle Forum Page and it will be answered as soon as possible.

5. Submitting your Work

Check the Wiki Page for helpful hints.

A marking quide is available (see below).

MOST IMPORTANT! You should submit all your required files as a zipped archive through the Moodle assignment 2 submission mechanism. Name the zip file yourStudentID.zip

It should contain

  1. banker.py your coding of the Banker's algorithm of section 2.
  2. banker.txt the answers to the Banker's algorithm of section 2.
  3. paging.py the complete Python text of your paging program from section 3, in runnable form
  4. PRA.py the PRA class.
  5. fifo.py the First-in, First-Out replacement algorithm.
  6. lru.py the Least Recently Used replacement algorithm.
  7. liu.py the Least Intensively Used replacement algorithm.
  8. replacement.txt a text file containing your answer to the page replacement problems.
All of these files should be text (ASCII/UTF-8) files.

Do not submit these files directly as they will be discarded! These must be packaged into a zip file. You must also take care to use the names exactly as given (observe case of letters).

and please, NO Word, rtf or rar files!!

Your work will be marked according to the following schema, which will be returned as an attachment under Moodle:

"marks.txt" 5.1 =
Assignment 2 Your name, Your student ID number PLEASE MAKE SURE YOU INCLUDE THESE ON ALL FILES! Q2 The Banker's Algorithm 2.0 (the program banker.py) /5 2.1 /1 2.2 /1 2.3 /1 2.4 /1 2.5 /3 2.6 /2 Q3 Page Replacement 3.1 PRA /2 3.1.1 FIFO /2 3.1.2 LRU /2 3.1.3 LIU /2 3.2 Main (replacement.txt) /4 3.4 Test /4 Total Marks /30 (weight 0.5)

6. Use of SVN

If you wish to use the svn repository, you must use your own private repository, fit2022-yourAuthCateName.zip. Students found using public areas will have their work removed, and they will not receive any marks for the assignment.

Document History

20100915:102940 3.1.2 ajh update banker.in data and change due date
20100907:132823 3.1.1 ajh fix error in banker.in value for P4/B/Max
20100831:151820 3.1.0 ajh added programming task to Banker's Algorithm
20100831:115212 3.0.0 ajh first version for 2010
This page maintained by John Hurst.
Copyright Monash University Copyright Policy
17 accesses since
03 Feb 2012
My PhotoTrain Photo

Generated at 20120510:2042 from an XML file modified on 20100915:1031
Maintainer use only; not generally accessible: Local Server Work Server CSSE Server

138 accesses since 02 Sep 2010, HTML cache rendered at 20120525:0431