83 citations · 343 across the 46 of their papers we have counts for
3 papers · 1 filter
Fast Online k-nn Graph Building
Thibault Debatty, Pietro Michiardi, Wim Mees
In this paper we propose an online approximate k-nn graph building algorithm, which is able to quickly update a k-nn graph using a flow of data points. One very important step of t…
On Fair Size-Based Scheduling
Matteo Dell'Amico, Damiano Carra, Pietro Michiardi
By executing jobs serially rather than in parallel, size-based scheduling policies can shorten time needed to complete jobs; however, major obstacles to their applicability are fai…
Revisiting Size-Based Scheduling with Estimated Job Sizes
Matteo Dell'Amico, Damiano Carra, Mario Pastorelli +1
We study size-based schedulers, and focus on the impact of inaccurate job size information on response time and fairness. Our intent is to revisit previous results, which allude to…