Search: onr:"swepub:oai:research.chalmers.se:3bcfca9a-fd05-4d1c-bad8-00cd5f3fa4c7" >
Average-Case Perfor...
Average-Case Performance of Static-Priority Scheduling on Multiprocessors
-
Andersson, Björn (author)
-
- Jonsson, Jan, 1962 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- ISBN 9150618598
- 2006
- 2006
- English.
-
In: ARTES - A Network for Real-Time Research and Graduate Education in Sweden. - 9150618598 ; , s. 513-535
- Related links:
-
https://research.cha...
Abstract
Subject headings
Close
- 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
- 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)
Keyword
- partitioning
- shared-memory multiprocessors
- multiprocessors
- preemptive scheduling
- global scheduling
- real-time scheduling
- static-priority scheduling
- dynamic binding
- bin-packing algorithms
Publication and Content Type
- kap (subject category)
- vet (subject category)
Find in a library
To the university's database