CS 580 Homework Assignment #4 (Due: Monday, April. 13)

Please write your proof rigorously.

1. [20 point] Problem 21-3, Page 521.
2. [15 point] Exercise 34.4-3, Page 1002.
3. [15 point] Exercise 34.5-2, Page 1017.
4. [15 point] Exercise 34.5-8, Page 1018.
5. [20 point] Problem 34-1, Page 1018.
6. [15 point] Scheduling with release times and deadlines. Suppose you have one machine M and n tasks t1, t2,..., tn. Each task ti has a length li, a release time ri and a deadline di. ti can not be scheduled on M before time ri, it runs uninterruptedly for li consecutive time units, and it must be finished by time di. Show that determining whether it is possible to schedule the n tasks without violating release times and deadlines is NP-complete.