Online makespan minimization in MapReduce-like systems with complex reduce tasks

DOI10.1007/S11590-015-0902-7MaRDI QIDQ526409zbMATH OpenOpenAlexFDO

Authors Taibo Luo, Yuqing Zhu, Weili Wu, Du Ding-Zhu, Yinfeng Xu

Publication date 12 May 2017

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-015-0902-7

zbMATH Keywords

big dataMapReduceonline scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online MapReduce scheduling problem of minimizing the makespan
• An optimal preemptive algorithm for online MapReduce scheduling on two parallel machines
• Online MapReduce processing on two identical parallel machines
• Online MapReduce scheduling on two uniform machines
• Optimal online algorithms for MapReduce scheduling on two uniform machines

Cited in

(7)

• Online MapReduce processing on two identical parallel machines
• MapReduce machine covering problem on a small number of machines
• Optimal online algorithms for 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
• Improved algorithms for MapReduce scheduling on uniform machines
• Online makespan minimization for MapReduce scheduling on multiple parallel machines

Describes a project that uses

Uses Software

• Hadoop
• MapReduce

This page was built for publication: Online makespan minimization in MapReduce-like systems with complex reduce tasks

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