Average-Case Performance of Static-Priority Scheduling on Multiprocessors
Kapitel i bok, 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.

partitioning

shared-memory multiprocessors

multiprocessors

preemptive scheduling

global scheduling

real-time scheduling

static-priority scheduling

dynamic binding

bin-packing algorithms

Författare

Björn Andersson

Jan Jonsson

Chalmers, Data- och informationsteknik, Datorteknik

ARTES - A Network for Real-Time Research and Graduate Education in Sweden

513-535

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

ISBN

91-506-1859-8

Mer information

Skapat

2017-10-06