Minimizing the stretch when scheduling flows of divisible requests

DOI10.1007/S10951-008-0078-4MaRDI QIDQ835622zbMATH OpenOpenAlexFDO

Authors Arnaud Legrand, Alan Su, Frédéric Vivien

Publication date 28 August 2009

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00789419/file/OnlineDivisible.pdf

zbMATH Keywords

linear programmingschedulingbioinformaticsheterogeneous computingstretchdivisible load

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2119737
• Online Scheduling to Minimize Average Stretch
• Approximation algorithms for average stretch scheduling
• Improved lower bounds for online scheduling to minimize total stretch
• scientific article; zbMATH DE number 1445347

Cites work

• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3560745 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256762 (Why is no real title available?)
• scientific article; zbMATH DE number 1303566 (Why is no real title available?)
• scientific article; zbMATH DE number 2119737 (Why is no real title available?)
• Approximation algorithms for average stretch scheduling
• Approximation algorithms for combinatorial problems
• Approximation schemes for preemptive weighted flow time
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• Minimizing the stretch when scheduling flows of divisible requests
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Online Scheduling to Minimize Average Stretch
• Open Shop Scheduling to Minimize Finish Time
• Parallelization of local BLAST service on workstation clusters
• Structure preserving reductions among convex optimization problems
• The complexity of mean flow time scheduling problems with release times
• The power of \(\alpha\)-points in preemptive single machine scheduling.

Cited in

(7)

• Resource allocation algorithms for virtualized service hosting platforms
• Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
• Minimizing the stretch when scheduling flows of divisible requests
• Improved lower bounds for online scheduling to minimize total stretch
• Online non-preemptive scheduling to optimize max stretch on a single machine
• Taming tail latency in key-value stores: a scheduling perspective
• A scheduling framework for distributed key-value stores and its application to tail latency minimization

Describes a project that uses

Uses Software

• mpiBLAST

This page was built for publication: Minimizing the stretch when scheduling flows of divisible requests

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