Online deadline scheduling on faster machines.

DOI10.1016/S0020-0190(02)00332-0zbMATH Open1042.68017OpenAlexW2080816716MaRDI QIDQ1853172FDOQ1853172

Authors: Jaehoon Kim, Kyung-Yong Chwa 

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00332-0

Recommendations

• Meeting deadlines: how much speed suffices?
• Online Scheduling with Hard Deadlines on Parallel Machines
• On-line scheduling with tight deadlines.
• scientific article; zbMATH DE number 1834669
• Competitive deadline scheduling via additional or faster processors

zbMATH Keywords

SchedulingOnline algorithms

Mathematics Subject Classification ID

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

Cites Work

• Speed is as powerful as clairvoyance
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improvements in throughout maximization for real-time scheduling
• On-line scheduling with hard deadlines
• Title not available (Why is that?)
• Performance guarantee for online deadline scheduling in the presence of overload
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Meeting deadlines: how much speed suffices?
• On-line scheduling with tight deadlines.
• Aggressive online deadline scheduling
• Handling critical jobs online: deadline scheduling and convex-body chasing

This page was built for publication: Online deadline scheduling on faster machines.

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