Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems
From MaRDI portal
Publication:2796402
DOI10.1145/2699435zbMath1333.68074OpenAlexW2211173788MaRDI QIDQ2796402
Sanjoy K. Baruah, Gianlorenzo D'Angelo, Haohan Li, Vincenzo Bonifaci, Suzanne Van der Ster, Alberto Marchetti-Spaccamela, Leen Stougie
Publication date: 24 March 2016
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01249091/file/baruah2015.pdf
Related Items (11)
Isolation scheduling on multicores: model and scheduling approaches ⋮ Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors ⋮ Mixed-criticality federated scheduling for parallel real-time tasks ⋮ Mixed-criticality scheduling on multiprocessors ⋮ Fault-tolerant and real-time scheduling for mixed-criticality systems ⋮ Computing the execution probability of jobs with replication in mixed-criticality schedules ⋮ Priority-based scheduling of mixed-critical jobs ⋮ FFOB: efficient online mode-switch procrastination in mixed-criticality systems ⋮ Dynamic budget management and budget reclamation for mixed-criticality systems ⋮ The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems ⋮ Schedulability analysis of a graph-based task model for mixed-criticality systems
Cites Work
- Unnamed Item
- Unnamed Item
- Feasibility problems for recurring tasks on one processor
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
- Branching and bounds tighteningtechniques for non-convex MINLP
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Scheduling Real-Time Mixed-Criticality Jobs
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems
