A dynamic scheduling grouping algorithm based on limited priority levels

MaRDI QIDQ5319798zbMATH OpenFDO

Authors Fugui He, Yibin Hou, Hui Li

Publication date 22 July 2009

zbMATH Keywords

dynamic schedulinglimited priority levelsreal-time schedulingtasks grouping algorithm

Mathematics Subject Classification ID

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

Recommendations

• A dynamic scheduling algorithm based on limited number of priority
• scientific article; zbMATH DE number 2112451
• Fixed priority scheduling with limited priority levels
• Rate monotonic scheduling in hard real-time systems
• Uniprocessor static priority scheduling with limited priority levels

Cited in

(7)

• A group priority earliest deadline first scheduling algorithm
• An algorithm for dynamic priority adjustment in a high-performance real- time DCC method
• A dynamic scheduling algorithm based on limited number of priority
• scientific article; zbMATH DE number 1877047 (Why is no real title available?)
• scientific article; zbMATH DE number 2112451 (Why is no real title available?)
• Uniprocessor static priority scheduling with limited priority levels
• Group-based Pfair scheduling

This page was built for publication: A dynamic scheduling grouping algorithm based on limited priority levels

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