Global static-priority scheduling of sporadic task systems on multiprocessor platforms

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn , Issue , 2006, Pages 153-159

  Fisher, Nathan ^a   Baruah, Sanjoy ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Multiprocessor platforms; Resource augmentation; Schedulability analysis; Static priority scheduling

Indexed keywords

MULTIPROCESSING SYSTEMS; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS; STATIC ANALYSIS;

MULTIPROCESSOR PLATFORMS; RESOURCE AUGMENTATION; SCHEDULABILITY ANALYSIS; STATIC PRIORITY SCHEDULING;

REAL TIME SYSTEMS;

EID: 38049134298     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. K. Abbott and H. Garcia-Molina. Scheduling real-time transactions: a performance evaluation. ACM Trans. Database Syst., 17(3):513-560, 1992.
2. T. Abdelzaher, B. Andersson, J. Jonsson, V. Sharma, and M. Nguyen. The aperiodic multiprocessor utilization bound for liquid tasks. In Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium, San Jose, California, September 2002. IEEE Computer Society Press.
3. T. P. Baker. An analysis of deadline-monotonic schedulability on a multiprocessor. Technical Report TR-030201, Department of Computer Science, Florida State University, 2003.
4. T. P. Baker. 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.
5. S. Baruah, R. Howell, and L. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems: The International Journal of Time-Critical Computing, 2:301-324, 1990.
6. S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium, pages 182-190, Orlando, Florida, 1990. IEEE Computer Society Press.
7. M. Bertogna, M. Cirinei, and G. Lipari. 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, December 2005. IEEE Computer Society Press.
8. N. Fisher, S. Baruah, and T. Baker. The partitioned scheduling of sporadic tasks according to staticpriorities. In Proceedings of the EuroMicro Conference on Real-Time Systems, Dresden, Germany, July 2006.
9. M. Klein, T. Ralya, B. Pollak, R. Obenza, and M. G. Harbour. A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston, 1993.
10. J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237-250, 1982.
11. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
12. A. K. Mok. 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.
13. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Transactions on Networking, 2(2): 137-150, April 1994.
14. C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 140-149, El Paso, Texas, 4-6 May 1997.
15. I. Ripoll, A. Crespo, and A. K. Mok. Improvement in feasibility testing for real-time tasks. Real-Time Systems: The International Journal of Time-Critical Computing, 11:19-39, 1996.