Task reweighting under global scheduling on multiprocessors

We consider schemes for enacting task share changes—a process called reweighting —on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are deployed in environments in which tasks may frequently request significant share changes. Prior work has shown that fair sched...

Full description

Saved in:
Bibliographic Details
Published in:Real-time systems 2008-08, Vol.39 (1-3), p.123-167
Main Authors: Block, Aaron, Anderson, James H., Devi, UmaMaheswari C.
Format: Article
Language:English
Subjects:
Algorithms
Communications Engineering
Computer Science
Computer Systems Organization and Communication Networks
Control
Mechatronics
Migration
Multiprocessing
Networks
Partitioning
Performance and Reliability
Real time
Robotics
Scheduling
Special Purpose and Application-Based Systems
Task scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider schemes for enacting task share changes—a process called reweighting —on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are deployed in environments in which tasks may frequently request significant share changes. Prior work has shown that fair scheduling algorithms are capable of reweighting tasks with minimal allocation error and that partitioning-based scheduling algorithms can reweight tasks with better average-case performance, but greater error. However, preemption and migration overheads can be high in fair schemes. In this paper, we consider the question of whether non-fair, earliest-deadline-first ( ) global scheduling techniques can improve the accuracy of reweighting relative to partitioning-based schemes and provide improved average-case performance relative to fair-scheduled systems. Our conclusion is that, for soft real-time systems, global schemes provide a good mix of accuracy and average-case performance.
ISSN:0922-6443
1573-1383
DOI:10.1007/s11241-007-9041-2