An earlier time for inserting and/or accelerating tasks

DOI10.1007/S11241-009-9066-9MaRDI QIDQ833042zbMATH OpenOpenAlexFDO

Authors Qian Guangming

Publication date 11 August 2009

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-009-9066-9

zbMATH Keywords

freed utilizationnew task insertionprocessor demandtask accelerationtranslation

Mathematics Subject Classification ID

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

Recommendations

• Insertion of a random task in a schedule: a real-time approach
• Earliest deadline first scheduling with rectifying faults
• Insertion of a random bitask in a schedule: a real-time approach
• On optimal lateness and tardiness scheduling in real-time systems
• An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

Cites work

• Rate monotonic vs. EDF: judgment day
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(3)

• Insertion of a random bitask in a schedule: a real-time approach
• Earliest deadline first scheduling with rectifying faults
• Insertion of a random task in a schedule: a real-time approach

This page was built for publication: An earlier time for inserting and/or accelerating tasks

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