Priority-based scheduling of mixed-critical jobs
From MaRDI portal
Publication:779444
DOI10.1007/S11241-019-09329-9zbMATH Open1436.68075OpenAlexW2919442026WikidataQ128302352 ScholiaQ128302352MaRDI QIDQ779444FDOQ779444
Authors: Dario Socci, Peter Poplavko, Saddek Bensalem, Marius Bozga
Publication date: 13 July 2020
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-019-09329-9
Recommendations
- Scheduling Real-Time Mixed-Criticality Jobs
- Scheduling real-time mixed-criticality jobs
- Scheduling algorithm for mixed-criticality jobs based on dynamical demand boundary
- Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
- Mixed-criticality scheduling to minimize makespan
- Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
- Mixed-criticality scheduling on multiprocessors
- Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks
- Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
- Optimal combinations of priority scheduling rules
list schedulingearliest deadline firstpreemptive schedulingtask graphmixed-critical schedulingmultiprocessor global scheduling
Cites Work
Cited In (20)
- Mixed-criticality scheduling on multiprocessors
- Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
- Mixed-criticality scheduling with limited hi-criticality behaviors
- A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- Mixed-criticality scheduling of sporadic task systems
- Improving the schedulability and quality of service for federated scheduling of parallel mixed-criticality tasks on multiprocessors
- Mixed-criticality scheduling to minimize makespan
- Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
- Intractability issues in mixed-criticality scheduling
- Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
- Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Computing the execution probability of jobs with replication in mixed-criticality schedules
- Mixed-criticality federated scheduling for parallel real-time tasks
- AdaptMC: a control-theoretic approach for achieving resilience in mixed-criticality systems
- Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
- Mixed criticality scheduling of probabilistic real-time systems
- Scheduling real-time mixed-criticality jobs
- Scheduling algorithm for mixed-criticality jobs based on dynamical demand boundary
- Replica-aware co-scheduling for mixed-criticality
This page was built for publication: Priority-based scheduling of mixed-critical jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779444)