3 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Malleable scheduling beyond identical machines
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines. In this setting, jobs…
cs.DS2016
Scheduling MapReduce Jobs under Multi-Round Precedences
Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos +2
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the ave…