Search: id:"swepub:oai:research.chalmers.se:3bcfca9a-fd05-4d1c-bad8-00cd5f3fa4c7" >
Average-Case Perfor...
-
Andersson, Björn
(author)
Average-Case Performance of Static-Priority Scheduling on Multiprocessors
- Article/chapterEnglish2006
Publisher, publication year, extent ...
Numbers
-
LIBRIS-ID:oai:research.chalmers.se:3bcfca9a-fd05-4d1c-bad8-00cd5f3fa4c7
-
ISBN:9150618598
-
https://research.chalmers.se/publication/25959URI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:kap swepub-publicationtype
-
Subject category:vet swepub-contenttype
Notes
-
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.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Jonsson, Jan,1962Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)janjo
(author)
-
Chalmers tekniska högskola
(creator_code:org_t)
Related titles
-
In:ARTES - A Network for Real-Time Research and Graduate Education in Sweden, s. 513-5359150618598
Internet link
Find in a library
To the university's database