Online makespan minimization in MapReduce-like systems with complex reduce tasks
From MaRDI portal
Publication:526409
DOI10.1007/s11590-015-0902-7zbMath1369.90081OpenAlexW596736753MaRDI QIDQ526409
Yuqing Zhu, Ding-Zhu Du, Taibo Luo, Weili Wu, Yin-Feng 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
Related Items (5)
An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines ⋮ Online MapReduce processing on two identical parallel machines ⋮ Online MapReduce scheduling problem of minimizing the makespan ⋮ MapReduce machine covering problem on a small number of machines ⋮ Optimal online algorithms for MapReduce scheduling on two uniform machines
Uses Software
This page was built for publication: Online makespan minimization in MapReduce-like systems with complex reduce tasks
