This program calcuates response time and schedulability of periodic tasks using Deadline-monotonic scheduling. Assuming all tasks arrive at the same time, they are processed in the shortest deadline order. With the given information of tasks, 'I' is caculated to find out if the task is schedulable. The response time is setted to -1 when the 't' converges to infinity.
Note that the I denotes interference time of Definition 1 and t is described in Definition 2 :
Deadline Monotonic Scheduling
This program loads "input.txt", which contains the number of tasks at the first line and (computation time, deadline, period) of a single task each line. In addition, the tasks are sorted by the deadline before the begining.
