An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines

DOI10.1142/S0217595918500136zbMath1395.90147OpenAlexW2802132362MaRDI QIDQ4565266

Wei Zhou, Yiwei Jiang, Ping Zhou

Publication date: 11 June 2018

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595918500136

zbMATH Keywords

competitive ratiomakespanonline algorithmMapReduce

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

MapReduce machine covering problem on a small number of machines ⋮ Optimal online algorithms for MapReduce scheduling on two uniform machines

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Online MapReduce scheduling problem of minimizing the makespan
• Online makespan minimization in MapReduce-like systems with complex reduce tasks
• An optimal algorithm for preemptive on-line scheduling

This page was built for publication: An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines