Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time

DOI10.1007/978-3-540-95891-8_31MaRDI QIDQ3599083zbMATH OpenOpenAlexFDO

Authors Jan Jeżabek

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-95891-8_31

Mathematics Subject Classification ID

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

Recommendations

• Scheduling uniform machines on-line requires nondecreasing speed ratios
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
• Speed is as powerful as clairvoyance
• An On-Line Algorithm for Some Uniform Processor Scheduling
• STACS 2004

Cites work

• Algorithms and Computation
• Algorithms – ESA 2004
• An optimal online algorithm for packet scheduling with agreeable deadlines
• Better online buffer management
• Buffer overflow management in QoS switches
• Considering suppressed packets improves buffer management in QoS switches
• Speed is as powerful as clairvoyance

This page was built for publication: Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time

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