Meeting Deadlines: How Much Speed Suffices?

DOI10.1007/978-3-642-22006-7_20zbMath1332.68019OpenAlexW1574209077WikidataQ57399766 ScholiaQ57399766MaRDI QIDQ3012809

No author found.

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_20

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Fault tolerant scheduling of tasks of two sizes under resource augmentation ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing ⋮ Online parallel scheduling of non-uniform tasks: trading failures for energy ⋮ Online dynamic power management with hard real-time guarantees

Cites Work

• Some simple scheduling algorithms
• Speed is as powerful as clairvoyance
• Optimal time-critical scheduling via resource augmentation
• Unnamed Item

This page was built for publication: Meeting Deadlines: How Much Speed Suffices?