Optimal Scheduling of Periodic Gang Tasks

Optimal Scheduling of Periodic Gang Tasks

The gang scheduling of parallel implicit-deadline periodic task systems upon identical multiprocessor platforms is considered. In this scheduling problem, parallel tasks use several processors simultaneously. We propose two DPFAIR (deadline partitioning) algorithms that schedule all jobs in every in...

Full description

Bibliographic Details
Main Authors: Goossens, Joël, Richard, Pascal
Format: Article
Language:English
Published: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik 2016-06-01
Series:Leibniz Transactions on Embedded Systems
Subjects:
real-time systems
scheduling
parallel tasks
Online Access:https://drops.dagstuhl.de/storage/07lites/lites_vol003/lites_vol003_issue001/LITES-v003-i001-a004/LITES-v003-i001-a004.pdf

Similar Items

Similar Items