10 citations · 10 across the 7 of their papers we have counts for
8 papers
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…
Energy-efficient algorithms for non-preemptive speed-scaling
Vincent Cohen-Addad, Zhentao Li, Claire Mathieu +1
We improve complexity bounds for energy-efficient speed scheduling problems for both the single processor and multi-processor cases. Energy conservation has become a major concern,…
Energy Efficient Scheduling of MapReduce Jobs
Evripidis Bampis, Vincent Chau, Dimitrios Letsios +3
MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first int…
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
Dimitrios Fotakis, Ioannis Milis, Emmanouil Zampetakis +1
We propose constant approximation algorithms for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce sys…
Speed scaling with power down scheduling for agreeable deadlines
Evripidis Bampis, Christoph Dürr, Fadi Kacem +1
We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload w_j and a release time r_j. The processor can vary its speed and hibern…
Proceedings Fourth Athens Colloquium on Algorithms and Complexity
Evangelos Markakis, Ioannis Milis
ACAC 2009 is organized by the Athens University of Economics and Business (AUEB) and it is the fourth in a series of meetings that aim to bring together researchers working on all…