Deterministic preemptive scheduling of real-time tasks

Algorithms for the preemptive scheduling of deterministic, real-time tasks can have applications in providing quality-of-service guarantees to packet flows in multichannel optical networks.

Saved in:
Bibliographic Details
Published inComputer (Long Beach, Calif.) Vol. 35; no. 5; pp. 72 - 79
Main Authors Jackson, L.E., Rouskas, G.N.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Asynchronous transfer mode
Bandwidth
Design
Multichannel
Multiprocessing systems
Optical communication
Optimal scheduling
Preempting
Processor scheduling
Real time
Real time systems
Round robin
Scheduling
Scheduling algorithm
Software
Switches
Tasks
Wavelength division multiplexing
Online AccessGet full text

Cover

More Information
Summary:Algorithms for the preemptive scheduling of deterministic, real-time tasks can have applications in providing quality-of-service guarantees to packet flows in multichannel optical networks.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2002.999778