On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks

DOI10.1109/12.508319MaRDI QIDQ4420880zbMATH OpenOpenAlexFDO

Authors Jayanta K. Dey, James F. Kurose, Don Towsley

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.508319

zbMATH Keywords

deadline based schedulingpriority scheduling

Mathematics Subject Classification ID

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

Recommendations

• A time Petri net framework to find optimal IRIS schedules
• On the competitiveness of on-line real-time task scheduling
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Extremal scheduling of parallel processing with and without real-time constraints
• Dynamic on-line task scheduling on parallel processors

Cited in

(2)

• Adaptive online scheduling of tasks with anytime property on heterogeneous resources
• A time Petri net framework to find optimal IRIS schedules

This page was built for publication: On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks

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