Integrating job parallelism in real-time scheduling theory
From MaRDI portal
Publication:963364
DOI10.1016/J.IPL.2007.11.014zbMATH Open1186.68060arXiv0805.3237OpenAlexW1996275534MaRDI QIDQ963364FDOQ963364
Authors: Sébastien Collette, Liliana Cucu, Joël Goossens 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0805.3237
Recommendations
- Feasibility analysis of sporadic real-time multiprocessor task systems
- Feasibility analysis of sporadic real-time multiprocessor task systems
- Real-time scheduling of linear speedup parallel tasks
- Multiprocessor scheduling for real-time systems
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Priority-driven scheduling of periodic task systems on multiprocessors
- Title not available (Why is that?)
- Deadline-based scheduling of periodic task systems on multiprocessors.
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
Cited In (9)
- Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks
- Analysis techniques for supporting hard real-time sporadic gang task systems
- The limited-preemptive feasibility of real-time tasks on uniprocessors
- T-L plane-based real-time scheduling for homogeneous multiprocessors
- Resource sharing among real-time components under multiprocessor clustered scheduling
- Stretching algorithm for global scheduling of real-time DAG tasks
- Multi-core real-time scheduling for generalized parallel task models
- Global EDF scheduling for parallel real-time tasks
- Mixed-criticality federated scheduling for parallel real-time tasks
Uses Software
This page was built for publication: Integrating job parallelism in real-time scheduling theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963364)
