Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4878 LNCS, Issue , 2007, Pages 204-216

  Baruah, Sanjoy ^a   Fisher, Nathan ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b WAYNE STATE UNIVERSITY   (United States)

Author keywords

Arbitrary deadlines; Deadline monotonie; Global scheduling; Multiprocessor scheduling; Real time systems; Schedulability analysis; Sporadic tasks

Indexed keywords

MULTIPROCESSING SYSTEMS; PROGRAM PROCESSORS; REAL TIME SYSTEMS;

DEADLINE MONOTONIE; SCHEDULABILITY ANALYSIS; SPORADIC TASKS;

SCHEDULING;

EID: 38449092057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77096-1_15     Document Type: Conference Paper

References (13)

1. Mok, A.K.: Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology (1983), Available as Technical Report No. MIT/LCS/TR-297
2. Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, pp. 182-190. IEEE Computer Society Press, Los Alamitos (1990)
3. Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237-250 (1982)
4. Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, Second edn. (2005)
5. Baker, T.P., Fisher, N., Baruah, S.: Algorithms for determining the load of a sporadic task system. Technical Report TR-051201, Department of Computer Science, Florida State University (2005)
6. Fisher, N., Baker, T., Baruah, S.: Algorithms for determining the demand-based load of a sporadic task system. In: Proceedings of the International Conference on Real-time Computing Systems and Applications, Sydney, Australia, IEEE Computer Society Press, Los Alamitos (2006)
7. Klein, M., Ralya, T., Pollak, B., Obenza, R., Harbour, M.G.: A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonie Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston (1993)
8. Audsley, N.C., Burns, A., Davis, R.I., Tindell, K.W., Wellings, A.J.: Fixed priority preemptive scheduling: An historical perspective. Real-Time Systems 8, 173-198 (1995)
9. Sha, L., Abdelzaher, T., Årzén, K.E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., Mok, A.K.: Real-time scheduling theory: A historical perspective. Real-Time Systems: The International Journal of Time-Critical Computing 28(2-3), 101-155 (2004)
10. Baker, T.P.: An analysis of fixed-priority schedulability on a multiprocessor. Real-Time Systems: The International Journal of Time-Critical Computing 32(1-2), 49-71 (2006)
11. Bertogna, M., Cirinei, M., Lipari, G.: New schedulability tests for real-time tasks sets scheduled by deadline monotonie on multiprocessors. In: Proceedings of the 9th International Conference on Principles of Distributed Systems, Pisa, Italy, IEEE Computer Society Press, Los Alamitos (2005)
12. Fisher, N., Baruah, S.: Global static-priority scheduling of sporadic task systems on multiprocessor platforms. In: Proceeding of the IASTED International Conference on Parallel and Distributed Computing and Systems, Dallas, TX, IASTED (November 2006)
13. Baruah, S.: Schedulability analysis of global deadline-monotonic scheduling (submission, 2007)