An exact schedulability test for Global Fixed Priority multiprocessor scheduling by using state space pruning. A detailed description of the methods is available in the following paper: https://www.computer.org/csdl/journal/tc/5555/01/09681210/1A8cppC7d28

This code simulates the exact schedulability test for EDF scheduling of semi-clairvoyant sporadic task systems with graceful degradation using the following two algorithms: (i) the previously proposed approach (listed as Algorithm 1 in the paper) and (ii) Mixed-Criticality Quick Processor-demand Analysis or MC-QPA (listed as Algorithm 2 in the p…