Online makespan minimization in MapReduce-like systems with complex reduce tasks
From MaRDI portal
Publication:526409
DOI10.1007/S11590-015-0902-7zbMATH Open1369.90081OpenAlexW596736753MaRDI QIDQ526409FDOQ526409
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
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 (6)
- MapReduce machine covering problem on a small number of machines
- Online makespan minimization for MapReduce scheduling on multiple parallel machines
- Online MapReduce processing on two identical parallel machines
- An optimal preemptive algorithm for online MapReduce scheduling on two parallel machines
- Online MapReduce scheduling problem of minimizing the makespan
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526409)
