loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
Daegu, Korea
August 21-August 24
ISBN: 0-7695-2975-5
ASCII Text
x 
 
Bjorn Andersson, Eduardo Tovar, "Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors," Real-Time Computing Systems and Applications, International Workshop on, pp. 111-119, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2007.31,
author = {Bjorn Andersson and Eduardo Tovar},
title = {Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2007},
issn = {1533-2306},
pages = {111-119},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2007.31},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
SN - 1533-2306
SP111
EP119
A1 - Bjorn Andersson,
A1 - Eduardo Tovar,
PY - 2007
KW - null
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Bjorn Andersson, Polytechnic Institute of Porto
Eduardo Tovar, Polytechnic Institute of Porto
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are . 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.
Citation:
Bjorn Andersson, Eduardo Tovar, "Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors," rtcsa, pp.111-119, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.