Optimal online algorithms for MapReduce scheduling on two uniform machines
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-01384-8
Abstract: We study online scheduling on two uniform machines in the MapReduce system. Each job consists of two sets of tasks, namely the map tasks and reduce tasks. A job’s reduce tasks can only be processed… read more here.
Keywords: preemptive reduce; reduce tasks; two uniform; scheduling two ... See more keywords
A Competitive Online Algorithm for Minimizing Total Weighted Completion Time on Uniform Machines
Sign Up to like & getrecommendations! Published in 2020 at "Mathematical Problems in Engineering"
DOI: 10.1155/2020/7527862
Abstract: We consider the classic online scheduling problem on m uniform machines in the online setting where jobs arrive over time. Preemption is not allowed.*e objective is to minimize total weighted completion time. An online algorithm… read more here.
Keywords: weighted completion; time; uniform machines; completion time ... See more keywords