MapReduce machine covering problem on a small number of machines

DOI10.1007/S10878-019-00436-8zbMATH Open1433.90136OpenAlexW2958182138MaRDI QIDQ2279746FDOQ2279746

Authors Yiwei Jiang, Ping Zhou, Wei Zhou

Publication date 13 December 2019

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

Full work available at URL https://doi.org/10.1007/s10878-019-00436-8

zbMATH Keywords

algorithmmachine covering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Improved algorithms for MapReduce scheduling on uniform machines
• An optimal preemptive algorithm for online MapReduce scheduling on two parallel machines
• Optimal online algorithms for MapReduce scheduling on two uniform machines
• Online MapReduce scheduling on two uniform machines
• Online MapReduce processing on two identical parallel machines

Cites work

• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• An optimal preemptive algorithm for online MapReduce scheduling on two parallel machines
• Online MapReduce scheduling problem of minimizing the makespan
• Online makespan minimization in MapReduce-like systems with complex reduce tasks
• Preemptive machine covering on parallel machines
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• The exact LPT-bound for maximizing the minimum completion time

Describes a project that uses

Uses Software

• MapReduce

This page was built for publication: MapReduce machine covering problem on a small number of machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279746)