Issue No. 10 - October (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.166609
<p>An optimal on-line scheduler is given for a set of real-time tasks with one common deadline on m processors. It is shown that no optimal scheduler can exist for tasks with two distinct deadlines. Finally, an optimal on-line scheduler is given for situations where processors can go down unexpectedly.</p>
online scheduling; real-time tasks; multiprocessing systems; real-time systems; scheduling.
K. Hong and J. Leung, "On-Line Scheduling of Real-Time Tasks," in IEEE Transactions on Computers, vol. 41, no. , pp. 1326-1331, 1992.