A paperLink opens in a new window co-authored by Arpan MukhopadhyayLink opens in a new window has received the Best Paper Award at ACM Mobihoc 2024Link opens in a new window. Mobihoc is a premier international conference on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing. The other authors in the paper are Samira Ghanbarian (uWaterloo), Ravi R. Mazumdar (uWaterloo), and Fabrice Guillemin (Orange Labs, France).

The paper addresses the problem of optimally allocating processors to parallelisable tasks having arbitrary concave speed-up functions. In general, determining the optimal number of processors to allocate to each task in an online fashion is a hard problem since allocating too many processors to one job will make those processors unavailable to other jobs whereas allocating too few processors will result in a small speed-up for the job. The paper proposes a simple randomised algorithm for determining the optimal number of processors to allocate to each job without requiring preemption (or repacking). It shows that the proposed algorithm is asymptotically optimal as the number of processors becomes large (which is often the case in modern clouds) and is also robust to variations in the job size distribution. This is the first time such an algorithm has been found in the literature.