A group priority earliest deadline first scheduling algorithm

DOI10.1007/S11704-012-1104-4MaRDI QIDQ1762218zbMATH OpenOpenAlexFDO

Authors Qi Li, Wei Ba

Publication date 15 November 2012

Published in Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11704-012-1104-4

zbMATH Keywords

real-time systemswitchinggroup prioritysuccess ratio

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A dynamic scheduling grouping algorithm based on limited priority levels
• Group-based Pfair scheduling
• Priority-grouping method for parallel multi-scheduling in grid
• Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure
• Solving group interval scheduling efficiently
• A dynamic scheduling algorithm based on limited number of priority
• Grouping techniques for scheduling problems: simpler and faster
• scientific article; zbMATH DE number 1877047

Cites work

• A non-preemptive scheduling algorithm for soft real-time systems
• Fixed priority scheduling with limited priority levels
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Static priority scheduling of event-triggered real-time embedded systems

Cited in

(1)

• Group-based Pfair scheduling

Describes a project that uses

Uses Software

• DAGMap

This page was built for publication: A group priority earliest deadline first scheduling algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762218)