Deterministic preemptive scheduling of real-time tasks

Computer

Volumn 35, Issue 5, 2002, Pages 72-79

  Jackson, Laura E ^a   Rouskas, George N ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS; OPTICAL COMMUNICATION; PACKET NETWORKS; QUALITY OF SERVICE; RESOURCE ALLOCATION; SCHEDULING;

PACKET SCHEDULING ALGORITHMS;

REAL TIME SYSTEMS;

EID: 0036570943     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/MC.2002.999778     Document Type: Article

References (18)

1. Scheduling of time critical processes
2. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case
3. Scheduling algorithms for multiprogramming in a hard-real-time environment
4. Efficient network QoS provisioning based on per node traffic shaping
5. Toward best effort services over WDM networks with fair access and minimum bandwidth guarantee
6. Implications of classical scheduling results for real-time systems
7. Scheduling with earliest start and due date constraints
8. Multiprogramming for hybrid computation
9. Multiprocessor on-line scheduling of hard-real-time tasks
10. A new algorithm for scheduling periodic, real-time tasks
11. Introduction to deterministic scheduling theory
12. Proportionate progress: A notion of fairness in resource allocation
13. A note on preemptive scheduling of periodic, real-time tasks
14. Scheduling periodically occurring tasks on multiple processors
15. On the complexity of fixed-priority scheduling of periodic, real-time tasks
16. New strategies for assigning real-time tasks to multiprocessor systems
17. An efficient Rms admission control and its application to multiprocessor scheduling
18. Using exact feasibility tests for allocating real-time tasks in multiprocessor systems