CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Average-Case Performance of Static-Priority Scheduling on Multiprocessors

Björn Andersson ; Jan Jonsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
ARTES - A Network for Real-Time Research and Graduate Education in Sweden p. 513-535. (2006)

This chapter deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highest-priority tasks that request to be executed are selected for execution. Many contemporary computers support static-priority scheduling using two different approaches: with task migration or without task migration. This chapter evaluates the performance of these approaches, using simulation of randomly-generated workloads on a range of different highly-abstracted architectural setups.

Nyckelord: real-time scheduling, global scheduling, dynamic binding, partitioning, bin-packing algorithms, static-priority scheduling, preemptive scheduling, multiprocessors, shared-memory multiprocessors

Editor(s): Hans Hansson

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2007-01-26. Senast ändrad 2011-02-17.
CPL Pubid: 25959