Issue No. 05 - May (2002 vol. 35)
Laura E. Jackson , North Carolina State University
George N. Rouskas , North Carolina State University
<p>Scheduling problems are characterizedby a system's processor typesand tasks and the scheduling constraintsimposed on them. For a giventask set, a number of processors greaterthan or equal to one, and a set of constraints,scheduling must determine theexistence of a feasible schedule and whatalgorithms can produce it.Many algorithms described in this surveycan be applied directly in a networkcontext. Existing multiprocessor schedulingalgorithms do not address certainaspects of packet scheduling, however,and this research area will likely becomeessential in the future.</p>
L. E. Jackson and G. N. Rouskas, "Deterministic Preemtive Scheduling of Real-Time Tasks," in Computer, vol. 35, no. , pp. 72-79, 2002.