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

DOI10.1007/S11590-015-0902-7zbMATH Open1369.90081OpenAlexW596736753MaRDI QIDQ526409FDOQ526409

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

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 dataonline schedulingMapReduce

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines
• 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
• Online MapReduce scheduling problem of minimizing the makespan
• Optimal online algorithms for MapReduce scheduling on two uniform machines

Uses Software

• MapReduce
• Hadoop

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)