Assignment5 - cannot be implemented by individual...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Assignment 5 Deadlocks and Memory Management CSCI 5103, Fall 2010 Due November 7, 2010 This assignment must be done individually. Problem 1 : Consider a system with consisting of m resources of the same type being shared by n processes. Prove that the system is deadlock free if: 1. Need(i) > 0 for i = 1, 2, 3, …, n, 2. The sum of all maximum needs is less than m+n . and Problem 2 : We can obtain the banker’s algorithm for a single resource type from the general banker’s algorithm simply by reducing the dimensionality of the various arrays by 1. Show through an example that the multiple-resource-type banker’s algorithm
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: cannot be implemented by individual application of the single-resource-type scheme to each resource type. Problem 3: Textbook (3 rd Edition US) Chapter 6 -- Problem 22 Problem 4: Chapter 3, Question 7 from the text book. Problem 5: Chapter 3, Question 14 from the text book. Problem 6: Please read Chapters 1 and 2 from the book OReilly book Linux Device Drivers, and answer the following question: What is the utility of the following kernel functions? insmod lsmod module_init module_exit printk...
View Full Document

This note was uploaded on 03/06/2012 for the course CSCI 5103 taught by Professor Staff during the Fall '08 term at Minnesota.

Ask a homework question - tutors are online