Online MapReduce scheduling problem of minimizing the makespan

DOI10.1007/s10878-015-9982-7zbMath1362.90184OpenAlexW2283852572MaRDI QIDQ511710

Yuqing Zhu, Chengyu Sun, Cong Chen, Yin-Feng Xu

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9982-7

zbMATH Keywords

makespanonline algorithmbig datamapreduce scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines ⋮ 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

Uses Software

• MapReduce
• DLMF

Cites Work

• Unnamed Item
• Online makespan minimization in MapReduce-like systems with complex reduce tasks
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Online scheduling of parallel jobs with preemption on two identical machines
• A Quicker Convergence to Euler's Constant

This page was built for publication: Online MapReduce scheduling problem of minimizing the makespan