next up previous
Next: About this document ... Up: Multiprocessor EDF and Deadline Previous: Conclusion and Future Work

Bibliography

1
B. Andersson, J. Jonsson, ``Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition'', Proceedings of the International Conference on Real-Time Computing Systems and Applications, Cheju Island, Korea (December 2000).

2
B. Andersson, S. Baruah, J. Jonsson, ``Static-priority scheduling on multiprocessors'', Proceedings of the IEEE Real-Time Systems Symposium, London, England (December 2001).

3
T.P. Baker, ``Stack-based scheduling of real-time processes'', The Real-Time Systems Journal 3,1 (March 1991) 67-100. (Reprinted in Advances in Real-Time Systems, IEEE Computer Society Press (1993) 64-96).

4
``An Analysis of EDF scheduling on a Multiprocessor'', technical report TR-030202, Florida State University Department of Computer Science, Tallahassee, Florida (February 2003). (available at http://www.cs.fsu.edu/research/reports)

5
T.P. Baker, ``An analysis of deadline-monotonic scheduling on a multiprocessor'', technical report TR-030301, Florida State University Department of Computer Science, Tallahassee, Florida (February 2003). (available at http://www.cs.fsu.edu/research/reports)

6
S. Baruah, Joel Goossens, ``Rate-monotonic scheduling on uniform multiprocessors'', UNC-CS TR02-025, University of North Carolina Department of Computer Science (May 2002).

7
S. Funk, J. Goossens, S. Baruah, ``On-line scheduling on uniform multiprocessors'', Proceedings of the IEEE Real-Time Systems Symposium, IEEE Computer Society Press (December 2001).

8
J. Goossens, S. Funk, S. Baruah, ``Priority-driven scheduling of periodic task systems on multiprocessors'', technical report UNC-CS TR01-024, University of North Carolina Computer Science Department, Real Time Systems, Kluwer, (to appear).

9
S.K. Dhall, C.L. Liu, ``On a real-time scheduling problem'', Operations Research 26 (1) (1998) 127-140.

10
T.M. Ghazalie and T.P. Baker, ``Aperiodic servers in a deadline scheduling environment'', the Real-Time Systems Journal 9,1 (July 1995) 31-68.

11
Lehoczky, J.P., Sha, L., Ding, Y., ``The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior'', Proceedings of the IEEE Real-Time System Symposium (1989) 166-171.

12
J.M. López, M. García, J.L. Díaz, and D.F. García, ``Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems'', Proceedings of the 12th Euromicro Conference on Real-Time Systems (2000) 25-33.

13
C.L. Liu and J. W. Layland, ``Scheduling algorithms for multiprogramming in a hard-real-time environment'', JACM 20.1 (January 1973) 46-61.

14
J. W.S. Liu, Real-Time Systems, Prentice-Hall (2000) 71.

15
Oh, D.I., and Baker, T.P. ``Utilization Bounds for $N$-Processor Rate Monotone Scheduling with Stable Processor Assignment'', Real Time Systems Journal, 15,1, September 1998. 183-193.

16
C.A. Phillips, C. Stein, E. Torng, J Wein, ``Optimal time-critical scheduling via resource augmentation'', Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (El Paso, Texas, 1997) 140-149.

17
P. Santiprabhob, C.S. Chen, T.P. Baker ``Ada Run-Time Kernel: The Implementation'', Proceedings of the 1st Software Engineering Research Forum, Tampa, FL, U.S.A. (November 1991) 89-98.

18
A. Srinivasan, S. Baruah, ``Deadline-based scheduling of periodic task systems on multiprocessors'', Information Processing Letters 84 (2002) 93-98.



Ted Baker 2003-09-11