|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Deterministic Preemtive Scheduling of Real-Time Tasks
May 2002 (vol. 35 no. 5)
pp. 72-79
| ASCII Text | x | ||
| Laura E. Jackson, George N. Rouskas, "Deterministic Preemtive Scheduling of Real-Time Tasks," Computer, vol. 35, no. 5, pp. 72-79, May, 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/MC.2002.999778, author = {Laura E. Jackson and George N. Rouskas}, title = {Deterministic Preemtive Scheduling of Real-Time Tasks}, journal ={Computer}, volume = {35}, number = {5}, issn = {0018-9162}, year = {2002}, pages = {72-79}, doi = {http://doi.ieeecomputersociety.org/10.1109/MC.2002.999778}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computer TI - Deterministic Preemtive Scheduling of Real-Time Tasks IS - 5 SN - 0018-9162 SP72 EP79 EPD - 72-79 A1 - Laura E. Jackson, A1 - George N. Rouskas, PY - 2002 VL - 35 JA - Computer ER - | |||
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.
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
Usage of this product signifies your acceptance of the Terms of Use.