Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems

Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto

doi:10.1007/978-3-642-15781-3_20

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems

MPS-Authors

/persons/resource/persons44160

Bonifaci, Vincenzo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Bonifaci, V., & Marchetti-Spaccamela, A. (2010). Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems. In M., de Berg, & U., Meyer (Eds.), Algorithms - ESA 2010 (pp. 230-241). Berlin: Springer. doi:10.1007/978-3-642-15781-3_20.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-1656-C

要旨

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.