42 citations · 56 across the 9 of their papers we have counts for
9 papers · 1 filter
Scheduling on Hybrid Platforms: Improved Approximability Window
Vincent Fagnon, Imed Kacem, Giorgio Lucarelli +1
Modern platforms are using accelerators in conjunction with standard processing units in order to reduce the running time of specific operations, such as matrix operations, and imp…
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang +2
In this paper, we consider the online problem of scheduling independent jobs \emph{non-preemptively} so as to minimize the weighted flow-time on a set of unrelated machines. There…
Online Non-preemptive Scheduling on Unrelated Machines with Rejections
Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang +2
When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving th…
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
Spyros Angelopoulos, Giorgio Lucarelli, Nguyen Kim Thang
We study online scheduling problems on a single processor that can be viewed as extensions of the well-studied problem of minimizing total weighted flow time. In particular, we pro…
Speed-scaling with no Preemptions
Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release d…
Energy Efficient Scheduling and Routing via Randomized Rounding
Evripidis Bampis, Alexander Kononov, Dimitrios Letsios +2
We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We…