cop5615fa11quiz4 - why does the approach not scale to more...

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

View Full Document Right Arrow Icon
Quiz 4 COP 5615 Fall 2011 1) Consider the real-time task set V={(2,10),(1,4),(1,3),(1,4)} a) Is V feasible under static priority scheduling? Prove or disprove. b) Is V feasible under dynamic priority scheduling? Prove or disprove. 2) a) In the Process Communication Model heuristic using min-cut approach,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: why does the approach not scale to more than two processors? Explain. b) Sketch a way adapt the min-cut method to more than two processors. Justify your extension. Where will it fail?...
View Full Document

This note was uploaded on 01/18/2012 for the course COP 5615 taught by Professor Staff during the Fall '08 term at University of Florida.

Ask a homework question - tutors are online