Integrating job parallelism in real-time scheduling theory

Authors:
Sébastien Collette;Liliana Cucu;Joël Goossens
Affiliations:
Université Libre de Bruxelles, C.P. 212, 50 Avenue F.D. Roosevelt, 1050 Brussels, Belgium;Université Libre de Bruxelles, C.P. 212, 50 Avenue F.D. Roosevelt, 1050 Brussels, Belgium;Université Libre de Bruxelles, C.P. 212, 50 Avenue F.D. Roosevelt, 1050 Brussels, Belgium
Venue:
Information Processing Letters
Year:
2008

Citing 12
Cited 7

PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
Parallel and vector computing: a practical introduction

Parallel and vector computing: a practical introduction
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing

PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
A New Approach for Scheduling of Parallelizable Tasks inReal-Time Multiprocessor Systems

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Parallel programming in OpenMP

Parallel programming in OpenMP
Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Parallel Processing for Real-Time Simulation: A Case Study

IEEE Parallel & Distributed Technology: Systems & Technology
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems

A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Energy-efficient scheduling for parallel real-time tasks based on level-packing

Proceedings of the 2011 ACM Symposium on Applied Computing
Server-based scheduling of parallel real-time tasks

Proceedings of the tenth ACM international conference on Embedded software
A semi-partitioned approach for parallel real-time scheduling

Proceedings of the 20th International Conference on Real-Time and Network Systems
Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks

Real-Time Systems
Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Proceedings of the 21st International conference on Real-Time Networks and Systems
Real-time programming on accelerator many-core processors

Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology

Quantified Score

Hi-index	0.89

Visualization

Abstract

We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions.