University of Tokushima
The preemptive real-time scheduling of sporadic parallel task systems is studied. The authors present an algorithm, called Gang EDF, which applies the Earliest-Deadline-First (EDF) policy to the traditional Gang scheduling scheme. They also provide schedulability analysis of Gang EDF. Specifically, the total amount of interference that is necessary to cause a deadline miss is first identified. The contribution of each task to the interference is then bounded. Finally, verifying that the total amount of contribution does not exceed the necessary interference for every task, the schedulability test is derived.