Global static-priority preemptive multiprocessor scheduling with utilization bound 38%

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

Volumn 5401 LNCS, Issue , 2008, Pages 73-88

  Andersson, Björn ^a  

^a POLYTECHNIC INSTITUTE OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPROCESSING SYSTEMS;

INTER-ARRIVAL TIME; MULTI-PROCESSOR SCHEDULING; PRIORITY SCHEDULING; PROCESSING CAPACITIES; REAL-TIME TASKS; UTILIZATION BOUNDS;

SCHEDULING;

EID: 58949088034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92221-6_7     Document Type: Conference Paper

References (16)

1. Gallmeister, B.: POSIX.4 Programmers Guide: Programming for the Real World. O'Reilly Media, Sebastopol (1995)
2. Sha, L., Rajkumar, R., Sathaye, S.: Generalized Rate-Monotonic Scheduling Theory: A Framework for Developing Real-Time Systems. Proceedings of the IEEE 82, 68-82 (1994)
3. Tindell, K.W.: An Extensible Approach for Analysing Fixed Priority Hard Real-Time Tasks. Technical Report, Department of Computer Science, University of York, UK YCS 189 (1992)
4. Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Technical Report, Department of Computer Science, University of York, UK YCS 189., 1992. Journal of the ACM, vol. 20, pp. 46-61 (1973)
5. Oh, D., Baker, T.P.: Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment. Real-Time Systems 5, 183-192 (1998)
6. Dhall, S., Liu, C: On a real-time scheduling problem. Operations Research 6, 127-140 (1978)
7. Baker, T.P.: An Analysis of Fixed-Priority Schedulability on a Multiprocessor. Real-Time Systems 32, 49-71 (2006)
8. Bertogna, M., Cirinei, M.: Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms. In: IEEE Real-Time Systems Symposium, Tucson, Arizona (2007)
9. Bertogna, M., Cirinei, M., Lipari, G.: New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors. In: 9th International Conference on Principles of Distributed Systems, Pisa, Italy (2005)
10. Cucu, L.: Optimal priority assignment for periodic tasks on unrelated processors. In: Euromicro Conference on Real-Time Systems (ECRTS 2008), WIP session, Prague, Czech Republic (2008)
11. Andersson, B., Baruah, S., Jonsson, J.: Static-Priority Scheduling on Multiprocessors. In: IEEE Real-Time Systems Symposium, London, UK (2001)
12. Lundberg, L.: Analyzing Fixed-Priority Global Multiprocessor Scheduling. In: Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2002) (2002)
13. Andersson, B., Jonsson, J.: The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In: Euromicro Conference on Real-Time Systems, Porto, Portugal (2003)
14. Liu, C.L.: Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60, 28-31 (1969)
15. Ha, R., Liu, J.W.S.: Validating timing constraints in multiprocessor and distributed real-time systems. In: Proceedings of the 14th International Conference on Distributed Computing Systems, Pozman, Poland (1994)
16. Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: ACM Symposium on Theory of Computing, El Paso, Texas, United States (1997)