loading...
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
Pisa, Italy July 04-July 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECRTS.2007.3419th Euromicro Conference on Real-Tim ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Nathan Fisher, Sanjoy Baruah, "The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms," Real-Time Systems, Euromicro Conference on, pp. 51-60, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ECRTS.2007.34,
author = {Nathan Fisher and Sanjoy Baruah},
title = {The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms},
journal ={Real-Time Systems, Euromicro Conference on},
volume = {0},
year = {2007},
issn = {1068-3070},
pages = {51-60},
doi = {http://doi.ieeecomputersociety.org/10.1109/ECRTS.2007.34},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Systems, Euromicro Conference on
TI - The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
SN - 1068-3070
SP51
EP60
A1 - Nathan Fisher,
A1 - Sanjoy Baruah,
PY - 2007
KW - null
VL - 0
JA - Real-Time Systems, Euromicro Conference on
ER -
 
Nathan Fisher, The University of North Carolina at Chapel Hill, USA
Sanjoy Baruah, The University of North Carolina at Chapel Hill, USA
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. These tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.
Citation:
Nathan Fisher, Sanjoy Baruah, "The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms," ecrts, pp.51-60, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.