Aggressive online deadline scheduling

MaRDI QIDQ2845522zbMATH OpenFDO

Authors Tsuen-Wan Johnny Ngan, Kar-Keung To, Prudence W. H. Wong, Tak-Wah Lam

Publication date 30 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066103000173

Mathematics Subject Classification ID

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

Recommendations

• Online Scheduling with Hard Deadlines
• scientific article; zbMATH DE number 1834669
• On-line scheduling with tight deadlines.
• Online scheduling with preemption or non-completion penalties
• scientific article; zbMATH DE number 1670659
• Online lazy bureaucrat scheduling with a machine deadline
• Online deadline scheduling on faster machines.
• scientific article; zbMATH DE number 1003261
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
• scientific article; zbMATH DE number 1796987

Cited in

(11)

• On-line scheduling with tight deadlines.
• A tighter extra-resource analysis of online deadline scheduling
• A tight analysis of Brown-Baker-Katseff sequences for online strip packing
• Competitive deadline scheduling via additional or faster processors
• Performance guarantee for online deadline scheduling in the presence of overload
• Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
• scientific article; zbMATH DE number 1305455 (Why is no real title available?)
• scientific article; zbMATH DE number 1796987 (Why is no real title available?)
• scientific article; zbMATH DE number 1834669 (Why is no real title available?)
• Performance guarantee for edf under overload
• LPT online strategy for parallel-machine scheduling with kind release times

This page was built for publication: Aggressive online deadline scheduling

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