A dynamic scheduling algorithm based on limited number of priority

zbMATH Open1150.68317MaRDI QIDQ3501546FDOQ3501546

Authors: Fugui He, Jiali Wang 

Publication date: 3 June 2008

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

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)

Cited In (8)

• Title not available (Why is that?)
• Fixed priority scheduling with limited priority levels
• 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
• A dynamic scheduling grouping algorithm based on limited priority levels
• A group priority earliest deadline first scheduling algorithm
• Uniprocessor static priority scheduling with limited priority levels
• Title not available (Why is that?)

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)