Improved algorithms for MapReduce scheduling on uniform machines

MaRDI QIDQ5193736zbMATH OpenFDO

Authors Qi Wei, Yong Wu, Yiwei Jiang

Publication date 20 September 2019

zbMATH Keywords

approximation algorithmmakespanMapReduceuniform machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimal online algorithms for MapReduce scheduling on two uniform machines
• Online MapReduce scheduling on two uniform machines
• An optimal preemptive algorithm for online MapReduce scheduling on two parallel machines
• Online MapReduce scheduling problem of minimizing the makespan
• Online makespan minimization in MapReduce-like systems with complex reduce tasks

Cited in

(10)

• Heuristics for periodical batch job scheduling in a MapReduce computing framework
• MapReduce machine covering problem on a small number of machines
• Optimal online algorithms for MapReduce scheduling on two uniform machines
• scientific article; zbMATH DE number 7235219 (Why is no real title available?)
• Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms
• Online MapReduce scheduling on two uniform machines
• Online MapReduce scheduling problem of minimizing the makespan
• Uniform machines scheduling with deteriorating effects in the MapReduce system
• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
• Scheduling MapReduce jobs on identical and unrelated processors

This page was built for publication: Improved algorithms for MapReduce scheduling on uniform machines

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