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

DOI10.1016/J.JPDC.2011.12.007zbMATH Open1242.68043OpenAlexW2074050979MaRDI QIDQ433430FDOQ433430

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

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

Recommendations

• Online scheduling of moldable parallel tasks
• Minimizing the stretch when scheduling flows of divisible requests
• An effective approximation algorithm for the malleable parallel task scheduling problem
• Online non-preemptive scheduling to optimize max stretch on a single machine
• scientific article; zbMATH DE number 1003247

zbMATH Keywords

simulationapproximation algorithmonline schedulingjob schedulingresource augmentationmaximum stretchmoldable tasksequential task

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Improved lower bounds for online scheduling to minimize total stretch
• Online non-preemptive scheduling to optimize max stretch on a single machine
• A scheduling framework for distributed key-value stores and its application to tail latency minimization

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

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