Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems Vol. 20; no. 4; pp. 553 - 566
Main Authors: Bertogna, M., Cirinei, M., Lipari, G.
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Computer System Implementation
Computer Systems Organization
Migration
Multi-core/single-chip multiprocessors
Multiprocessing systems
Multiprocessor
Multiprocessor Systems
Operating Systems
Organization and Design
Parallel Architectures
Partitioning algorithms
Platforms
Process Management
Processor Architectures
Processor scheduling
Processors
Real time
Real time systems
Real-time and embedded systems
Real-time distributed
Runtime
Scheduling
Scheduling algorithm
Scheduling and task partitioning
Software/Software Engineering
Special-Purpose and Application-Based Systems
Tasks
Technological innovation
Testing
Processor Architectures
Computer Systems Organization
Multiprocessor Systems
Special-Purpose and Application-Based Systems
Process Management
Scheduling
Parallel Architectures
Computer System Implementation
Operating Systems
Scheduling and task partitioning
Multi-core/single-chip multiprocessors
Software/Software Engineering
Real-time and embedded systems
Organization and Design
Real-time distributed
ISSN:1045-9219, 1558-2183
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. We assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during a task lifetime. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: earliest deadline first (EDF) and fixed priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of accepted task sets. The effectiveness of the proposed test is shown through an extensive set of synthetic experiments.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2008.129