Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
DOI10.1016/J.IPL.2016.02.009zbMATH Open1335.68023OpenAlexW2289316938MaRDI QIDQ280937FDOQ280937
Authors: Yao Chen, Kang G. Shin, Huagang Xiong
Publication date: 10 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.02.009
Recommendations
mixed-criticalityschedulability analysisreal-time systemsfixed-priority schedulingpriority assignment algorithm
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (6)
- Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
- Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling
- Priority-based scheduling of mixed-critical jobs
- The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
This page was built for publication: Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280937)