A dynamic scheduling algorithm based on limited number of priority

MaRDI QIDQ3501546zbMATH OpenFDO

Authors Fugui He, Jiali Wang

Publication date 3 June 2008

zbMATH Keywords

dynamic schedulinglimited number of priority levelreal-time tasks scheduling

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
• scientific article; zbMATH DE number 2112451
• Fixed priority scheduling with limited priority levels
• Uniprocessor static priority scheduling with limited priority levels
• Dynamic- and static-priority scheduling of recurring real-time tasks

Cited in

(8)

• A group priority earliest deadline first scheduling algorithm
• An algorithm for dynamic priority adjustment in a high-performance real- time DCC method
• Intelligent time slice for round robin in real time operating systems
• Fixed priority scheduling with limited priority levels
• scientific article; zbMATH DE number 2112421 (Why is no real title available?)
• scientific article; zbMATH DE number 2112451 (Why is no real title available?)
• A dynamic scheduling grouping algorithm based on limited priority levels
• Uniprocessor static priority scheduling with limited priority levels

This page was built for publication: A dynamic scheduling algorithm based on limited number of priority

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