The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2002 vol.35)
pp: 72-79
Laura E. Jackson , North Carolina State University
George N. Rouskas , North Carolina State University
ABSTRACT
<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>
CITATION
Laura E. Jackson, George N. Rouskas, "Deterministic Preemtive Scheduling of Real-Time Tasks", Computer, vol.35, no. 5, pp. 72-79, May 2002, doi:10.1109/MC.2002.999778
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool