Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms

DOI10.4230/LIPICS.ESA.2016.68MaRDI QIDQ4606340zbMATH OpenFDO

Authors Riley Murray, Megan Chao, Samir Khuller

Publication date 2 March 2018

zbMATH Keywords

distributed computingapproximation algorithmsmachine schedulingprimal-dual algorithmsLP relaxations

Mathematics Subject Classification ID

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

Recommendations

• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
• Scheduling MapReduce jobs on identical and unrelated processors
• Scheduling MapReduce jobs under multi-round precedences
• Improved algorithms for MapReduce scheduling on uniform machines
• Improved approximation algorithms for scheduling parallel jobs on identical clusters

Cited in

(6)

• Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
• scientific article; zbMATH DE number 7338327 (Why is no real title available?)
• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
• On scheduling coflows
• Streaming algorithms for multitasking scheduling with shared processing

This page was built for publication: Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms

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