A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
2009
IEEE Transactions on Parallel and Distributed Systems
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during a task lifetime. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two
doi:10.1109/tpds.2008.129
fatcat:fznu2hfjbvba3jleihhaui2ilq