Online MapReduce scheduling problem of minimizing the makespan

MapReduce system is a popular big data processing framework, and the performance of it is closely related to the efficiency of the centralized scheduler. In practice, the centralized scheduler often has little information in advance, which means each job may be known only after being released. In this paper, hence, we consider the online MapReduce scheduling problem of minimizing the makespan, where jobs are released over time. Both preemptive and non-preemptive version of the problem are considered. In addition, we assume that reduce tasks cannot be parallelized because they are often complex and hard to be decomposed. For the non-preemptive version, we prove the lower bound is $$\frac{m+m(\Psi (m)-\Psi (k))}{k+m(\Psi (m)-\Psi (k))}$$ m + m ( Ψ ( m ) - Ψ ( k ) ) k + m ( Ψ ( m ) - Ψ ( k ) ) , higher than the basic online machine scheduling problem, where k is the root of the equation $$k=\big \lfloor {\frac{m-k}{1+\Psi (m)-\Psi (k)}+1 }\big \rfloor $$ k = ⌊ m - k 1 + Ψ ( m ) - Ψ ( k ) + 1 ⌋ and m is the quantity of machines. Then we devise an $$(2-\frac{1}{m})$$ ( 2 - 1 m ) -competitive online algorithm called MF-LPT (Map First-Longest Processing Time) based on the LPT. For the preemptive version, we present a 1-competitive algorithm for two machines.