New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling

DOI10.1016/j.tcs.2006.06.003zbMath1099.68014OpenAlexW1565651529MaRDI QIDQ2503312

Kin-Shing Liu, Wun-Tat Chan, Prudence W. H. Wong, Tak-Wah Lam

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.003

zbMATH Keywords

multiprocessor schedulingcompetitive analysisonline algorithmsresource augmentation

Mathematics Subject Classification ID

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

Cites Work

• Minimizing total flow time and total completion time with immediate dispatching
• Applying extra-resource analysis to load balancing.
• A unified analysis of hot video schedulers
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Server scheduling in the L _p norm
• Speed is as powerful as clairvoyance
• Online Scheduling to Minimize Average Stretch
• Maximizing job completions online
• Algorithms for minimizing weighted flow time
• Scheduling in the dark
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling