Optimal Task Assignment to Heterogeneous Federated Learning Devices

TL;DR

This paper introduces OLAR, an optimal polynomial-time algorithm for task assignment in heterogeneous federated learning devices, minimizing training round durations while respecting device constraints.

Contribution

The paper formulates federated learning task assignment as a makespan minimization problem and proposes OLAR, an optimal algorithm with proven efficiency and effectiveness.

Findings

OLAR achieves optimal scheduling with low execution time.

Lower and upper task limits negate benefits of suboptimal heuristics.

Experimental results demonstrate OLAR's superiority over existing algorithms.

Abstract

Federated Learning provides new opportunities for training machine learning models while respecting data privacy. This technique is based on heterogeneous devices that work together to iteratively train a model while never sharing their own data. Given the synchronous nature of this training, the performance of Federated Learning systems is dictated by the slowest devices, also known as stragglers. In this paper, we investigate the problem of minimizing the duration of Federated Learning rounds by controlling how much data each device uses for training. We formulate this problem as a makespan minimization problem with identical, independent, and atomic tasks that have to be assigned to heterogeneous resources with non-decreasing cost functions while respecting lower and upper limits of tasks per resource. Based on this formulation, we propose a polynomial-time algorithm named OLAR and prove that it provides optimal schedules. We evaluate OLAR in an extensive experimental evaluation using simulation that includes comparisons to other algorithms from the state of the art and new extensions to them. Our results indicate that OLAR provides optimal solutions with a small execution time. They also show that the presence of lower and upper limits of tasks per resource erase any benefits that suboptimal heuristics could provide in terms of algorithm execution time.