Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
Ref: HURRAY-TR-081002 Publication Date: 15 to 18, Dec, 2008
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
Ref: HURRAY-TR-081002 Publication Date: 15 to 18, Dec, 2008Abstract:
Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.
Björn AnderssonDocument:
View
Download12th International Conference on Principles of Distributed Systems (OPODIS 2008), Springer Berlin Heidelberg, 5401, pp 73-78.
Luxor, Egypt.
DOI:10.1007/978-3-540-92221-6_7.
WOS ID: 000263683700005.
Notes: In Lecture Notes in Computer Science Series
Record Date: 1, Dec, 2008
Short links for this page: www.cister.isep.pt/docs/10_1007_978_3_540_92221_6_7 www.cister.isep.pt/docs/000263683700005 www.cister.isep.pt/docs/hurray_tr_081002 www.cister.isep.pt/docs/432