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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimised Task Placement for MLOps

Pedro Rodrigues, Leonardo Almeida, Mário Antunes, Júlio Corona et al.
Semantic Web and Ontologies
article

Optimised Task Placement for MLOps

Pedro Rodrigues, Leonardo Almeida, Mário Antunes, Júlio Corona, Rui L. Aguiar
article en

Abstract

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.

Instituto de Telecomunicações (PT), University of Aveiro (PT)
Openalex Percentile: Top 87%
Semantic Web and Ontologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimised Task Placement for MLOps — Pedro Rodrigues, Leonardo Almeida, et al. · (2025) | TGRS Research Map | TGRS