Treffer: Algorithmica manuscript No. (will be inserted by the editor) Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
Title:
Algorithmica manuscript No. (will be inserted by the editor) Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
Authors:
Contributors:
The Pennsylvania State University CiteSeerX Archives
Collection:
CiteSeerX
Document Type:
Fachzeitschrift
text
File Description:
application/pdf
Language:
English
Availability:
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.AF8B2D49
Database:
BASE
Weitere Informationen
the date of receipt and acceptance should be inserted later Abstract We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving an open problem in the area of multiprocessor real-time scheduling [S. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.