Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks

DOI10.1016/j.jpdc.2011.12.007zbMath1242.68043OpenAlexW2074050979MaRDI QIDQ433430

Ümit V. Çatalyürek, Erik Saule, Doruk Bozdağ

Publication date: 13 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.12.007

zbMATH Keywords

simulationapproximation algorithmjob schedulingonline schedulingresource augmentationmaximum stretchmoldable tasksequential task

Mathematics Subject Classification ID

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

Related Items (2)

Improved lower bounds for online scheduling to minimize total stretch ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling to minimize staleness and stretch in real-time data warehouses
• Minimizing the stretch when scheduling flows of divisible requests
• Average stretch without migration
• Non-clairvoyant scheduling for minimizing mean slowdown
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Speed is as powerful as clairvoyance
• Scheduling data transfers in a network and the set scheduling problem
• Online Scheduling to Minimize Average Stretch
• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• Bounds for Certain Multiprocessing Anomalies
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks