cs162_fa08_mt1-12 - Maximum Thread ID A B C A B C T1 2 1 3...

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

View Full Document Right Arrow Icon
CS 162 Fall 2008 Midterm Exam I October 15, 2008 Page 14/21 Problem 4d[4pts]: Suppose that we have the following resources: A, B, C and threads T1, T2, T3, T4. The total number of each resource is: Further, assume that the processes have the following maximum requirements and current allocations: Current Allocation
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Maximum Thread ID A B C A B C T1 2 1 3 4 9 4 T2 1 2 3 5 3 3 T3 5 4 3 6 4 3 T4 2 1 2 4 8 2 Is the system in a safe state? If yes, show a non-blocking sequence of thread executions. Otherwise, provide a proof that the system is unsafe. Show all steps, intermediate matrices, etc. Total A B C 12 9 12...
View Full Document

This note was uploaded on 08/26/2009 for the course CS 162 taught by Professor Kubiatowicz during the Spring '02 term at University of California, Berkeley.

Ask a homework question - tutors are online