Next: MULTIPROCESSOR SCHEDULING
Up: MULTIPROCESSOR SCHEDULING
Previous: RESOURCE RECLAIMING
- 1.
- TR90-67
Bounds on the Schedule Length of Some Heuristic Scheduling Algorithms for
Hard Real-Time Tasks
F. Wang, Ramamritham, Stankovic
- 2.
- Bounds on the Performance of Heuristic Algorithms for Multiprocessor
Scheduling
of Hard Real-Time Tasks
F. Wang, Ramamritham, Stankovic
(To appear) 13th Real-Time Systems Symposium, Dec. 1992.
- 3.
- TR 91-54 Worst Case Analysis for On-Line Scheduling in Real-Time Systems
Wang, Mao
(Submitted) Real-Time Systems Symposium, May 1991
- 4.
- Performance Analysis of FCFS and Improved FCFS Scheduling Algorithms for
Dynamic Real-Time Computer Systems
Zhao Wei and Stankovic
Real-Time System Symposium, pp. 156-165, December 1989
- 5.
- Well-Timed Scheduling: A Framework for Dynamic Real-Time Scheduling
Zlokapa, Stankovic, Ramamritham
(Submitted) IEEE Trans. on Parallel and Distributed Systems,
Nov. 1991
- 6.
- TR86-17 Performance Analysis of a Probability Model for Scheduling
Hard Real-Time Tasks
Wei Zhao
- 7.
- Spring Software Simulation Testbed
Chia Shen
- 8.
- TR93-51 Real-Time Systems: Well-Timed Scheduling and Scheduling with
Precedence Constraints
Zlokapa
PhD Thesis
- 9.
- Preprocessing of Task Characteristics to Improve On-line
Schedulability of Precedence Related Tasks
Zlokapa and Ramamritham
(Submitted) RTSS '93
Gary Wallace
3/19/1998