* Liu and Layland Bound, see [ResAugmentation](https://moodle.tu-dortmund.de/pluginfile.php/1976120/course/section/428170/ResAugmentation.pdf) slide 27.
* Time Demand Analysis, see [Sporadic-FP](https://moodle.tu-dortmund.de/pluginfile.php/1976120/course/section/428170/Sporadic-FP.pdf) slide 38.
* Hyperbolic Bound, see [ResAugmentation](https://moodle.tu-dortmund.de/pluginfile.php/1976120/course/section/428170/ResAugmentation.pdf) slide 36.
All Tasks are periodic, preemptable, fixed priority Tasks with implicit Deadlines.
The task sets are defined int the text files in 'task_sets/'.
## Implementing the Tests
The tests can be found in 'schedTests/' folder in their corresponding files.
The test() functions are called, if the test was successful it should return True, otherwise False. For the TDA test the code for sorting the task set is already included, so the task set is ordered by highest priority first.
The tasksets are represented by a 2D array, where row i is a Task i and the columns contain period(P_i), Deadline (D_i) and WCET (C_i). This is stated in each file with a large comment and examples are given.