Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Parallel programming in OpenMP
Parallel programming in OpenMP
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
An Analysis of EDF Schedulability on a Multiprocessor
IEEE Transactions on Parallel and Distributed Systems
Integrating job parallelism in real-time scheduling theory
Information Processing Letters
Intel threading building blocks
Intel threading building blocks
Gang EDF Scheduling of Parallel Task Systems
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Scheduling Parallel Real-Time Tasks on Multi-core Processors
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Journal of Systems Architecture: the EUROMICRO Journal
Multi-core Real-Time Scheduling for Generalized Parallel Task Models
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Predictability of least laxity first scheduling algorithm on multiprocessor real-time systems
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.00 |
In this paper we study the scheduling of parallel and real-time recurrent tasks on multiprocessor platforms. Firstly, we propose a new parallel task model which allows recurrent tasks to be composed of several phases, each one composed of several threads. Each thread requires a single processor for execution and can be scheduled simultaneously. We then propose an algorithm to transpose popular Fork-Join task model to our MPMT task model. Secondly, we define several kinds of real-time schedulers that can be applied to our parallel task model. We distinguish between two scheduling classes: Hierarchical schedulers and Global Thread schedulers. We present and prove correct an exact schedulability test for each class. Lastly, we also evaluate the performance of our scheduling paradigm in comparison with Gang scheduling by means of simulations. In this work we extend the work of Lupu and Goossens in Scheduling of hard real-time multi-thread periodic tasks (Real-Time and Network Systems, 2011) which considers mono-phase multi-thread task model. We extend their previous results to a Multi-Phase Multi-Thread task model.