Literature

These research articles and course book excepts can be downloaded from the course home page. For copyright reasons, it is required that you are logged on to PingPong for downloading the documents.

K. Jeffay, D. F. Stanat and C. U. Martel: "On Non-Preemptive Scheduling of Periodic and Sporadic Tasks"

In Proceedings of the  Real-Time Systems Symposium, December 4-6, 1991, San Antonio, Texas,  pp. 129-139.

PDF ]

J. Xu and D. L. Parnas: "Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Constraints"

IEEE Transactions on Software Engineering, Vol. 16, No. 3, March 1990, pp. 360-369.

PDF ]

K. W. Tindell, A. Burns and A. Wellings: "Allocating Hard Real-Time Tasks: An NP-Hard Problem Made Easy"

Real-Time Systems: The International Journal on Time-Critical Computing, Vol. 4, No. 2, June 1992, pp. 145-165.

PDF]

J. Jonsson and K. G. Shin: "A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System"

In Proceedings of the Int'l Conference on Parallel Processing, August 11-14, 1997, Bloomington, Illinois, pp. 158-165.

PDF]

R. I. Davis, A. Burns, R. J. Bril and J. J. Lukkien: "Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited and Revised"

Real-Time Systems: The International Journal on Time-Critical Computing, Vol. 35, No. 3, April 2007, pp. 239-272.

PDF]

K. Zuberi and K. G. Shin: "Non-Preemptive Scheduling of Messages on Controller Area Network for Real-Time Control Applications"

In Proceedings of the  Real-Time Technology and Applications Symposium, May 15-17, 1995, Chicago, Illinois, pp. 240-249.

PDF ]

B. Chen and W. Zhao: "Properties of the Timed Token Protocol" 

Technical Report 92-038, Department of Computer Science, Texas A&M University, College Station, Texas, October 1992.

PDF ]

S. S. Sathaye and J. K. Strosnider: "Conventional and Early Token Release Scheduling Models for the IEEE 802.5 Token Ring" 

Real-Time Systems: The International Journal on Time-Critical Computing, Vol. 7, No. 1, 1994, pp. 5-32.

PDF ]

S. K. Baruah, N. K. Cohen, C. G. Plaxton and D. A. Varvel: "Proportionate Progress: A Notion of Fairness in Resource Allocation"

Algorithmica, Vol. 15, 1996, pp. 600-625.

PDF (overview presentation of Pfair scheduling by B. Andersson: PDF)

B. Andersson, S. Baruah and J. Jonsson: "Static-Priority Scheduling on Multiprocessors"

In Proceedings of the  Real-Time Systems Symposium, December 3-6, 2001, London, England, pp. 193 - 202.

PDF ]

R. Wilhelm, J. Engblom, A. Ermedahl et al.: "The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools,"

ACM Transactions on Embedded Computing Systems.

PDF ]

A. Ermedahl and J. Engblom, "Execution Time Analysis for Embedded Real-Time Systems"

Draft document.

PDF ]

C. M. Krishna and K. G. Shin: "Real-Time Systems"

McGraw-Hill, 1997, ISBN 0-07-114243-6 (paperback), ISBN 0-07-057043-4 (cloth) - Out of print

Errata sheet: PDF ]

Chapter 3
   [hi-res: pt 1, pt 2, pt 3, pt 4, pt 5]
   [lo-res: pt 1, pt 2, pt 3, pt 4, pt 5]

Chapter 6
  
[hi-res: pt 1, pt 2, pt 3]
   [lo-res: pt 1, pt 2, pt 3].