Average-Case Performance of Static-Priority Scheduling on Multiprocessors

• This chapter deals with the problem of scheduling a set oftasks 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.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datorteknik (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Engineering (hsv//eng)

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

partitioning

shared-memory multiprocessors

multiprocessors

preemptive scheduling

global scheduling

real-time scheduling

static-priority scheduling

dynamic binding

bin-packing algorithms

Publikations- och innehållstyp

kap (ämneskategori)

vet (ämneskategori)