Sporadic Multiprocessor Scheduling with Few Preemptions
Ref: HURRAY-TR-070501 Publication Date: 1, May, 2007
Sporadic Multiprocessor Scheduling with Few Preemptions
Ref: HURRAY-TR-070501 Publication Date: 1, May, 2007Abstract:
Consider the problem of scheduling a set of n sporadically
arriving tasks with the goal of meeting deadlines on
a computer system comprising m processors. Processors
are identical. A task τi is characterized by its minimum
inter-arrival time Ti and its execution time Ci. Tasks can
be preempted and they can migrate between processors. We
propose an algorithm with utilization bound no lower than
88% and it generates few preemptions.
Björn AnderssonDocument:
View
DownloadRecord Date: 1, May, 2007
Short links for this page: www.cister.isep.pt/docs/hurray_tr_070501 www.cister.isep.pt/docs/348