Uniprocessor static priority scheduling with limited priority levels

MaRDI QIDQ5478258zbMATH OpenFDO

Authors Baojin Wang, Mingshu Li, Zhigang Wang

Publication date 12 July 2006

zbMATH Keywords

decreasing priority assignmentincreasing priority assignment

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2112451
• Fixed priority scheduling with limited priority levels
• A dynamic scheduling algorithm based on limited number of priority
• A dynamic scheduling grouping algorithm based on limited priority levels
• Static priority scheduling of event-triggered real-time embedded systems

Cited in

(7)

• SPT is optimally competitive for uniprocessor flow
• Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
• A dynamic scheduling algorithm based on limited number of priority
• Fixed priority scheduling with limited priority levels
• scientific article; zbMATH DE number 2112451 (Why is no real title available?)
• A dynamic scheduling grouping algorithm based on limited priority levels
• Scheduling and priority mapping for static real-time milddleware

This page was built for publication: Uniprocessor static priority scheduling with limited priority levels

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