Optimised Task Placement for MLOps
To accelerate Machine Learning Operations (MLOps) workflows, where Machine Learning (ML) pipelines are the most time-consuming element, heterogeneous environments can be used. However, to take full advantage of this heterogeneity, it is essential to determine the appropriate machine for each task in the pipeline. In this paper, we present a task placement system for ML pipelines that automatically assigns tasks to the most appropriate machine, with the goal of reducing the overall execution time. The placement process is divided into two phases: pipeline scheduling and task placement. The scheduling phase uses the Shortest Job First (SJF) algorithm to determine the pipeline execution order, while the task placement phase uses a heuristic-based approach. Results show that the proposed solution significantly outperforms baseline strategies, achieving reductions in total execution time and average waiting time.
Authors
- Pedro Rodrigues (ORCID: https://orcid.org/0009-0009-5916-4062)
- Leonardo Almeida (ORCID: https://orcid.org/0000-0002-0921-887X)
- Mário Antunes (ORCID: https://orcid.org/0000-0002-6504-9441)
- Júlio Corona (ORCID: https://orcid.org/0009-0001-7898-7883)
- Rui L. Aguiar (ORCID: https://orcid.org/0000-0003-0107-6253)
Institutions
- Instituto de Telecomunicações (PT)
- University of Aveiro (PT)
Publication Details
- Published
- 2025-04-28
- DOI
- https://doi.org/10.1109/icct-europe63283.2025.11157658
- Primary Topic
- Semantic Web and Ontologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00