Average stretch without migration

DOI10.1016/j.jcss.2003.06.001zbMath1072.68015OpenAlexW2042237882MaRDI QIDQ1878679

Yanyan Li

Publication date: 8 September 2004

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2003.06.001

zbMATH Keywords

scheduling parallel machines online

Mathematics Subject Classification ID

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

Related Items (4)

Approximating total flow time on parallel machines ⋮ Improved lower bounds for online scheduling to minimize total stretch ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Reallocation problems in scheduling

Cites Work

• Eliminating Migration in Multi-processor Scheduling
• Minimizing the flow time without migration
• Online Scheduling to Minimize Average Stretch
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average stretch without migration