Block size estimation for data partitioning in HPC applications using machine learning techniques

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Cantini, Riccardo, Marozzo, Fabrizio, Orsino, Alessio, Talia, Domenico, Trunfio, Paolo, Badia, Rosa M., Ejarque, Jorge, Vazquez, Fernando
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917579937808384
author Cantini, Riccardo
Marozzo, Fabrizio
Orsino, Alessio
Talia, Domenico
Trunfio, Paolo
Badia, Rosa M.
Ejarque, Jorge
Vazquez, Fernando
author_facet Cantini, Riccardo
Marozzo, Fabrizio
Orsino, Alessio
Talia, Domenico
Trunfio, Paolo
Badia, Rosa M.
Ejarque, Jorge
Vazquez, Fernando
contents The extensive use of HPC infrastructures and frameworks for running dataintensive applications has led to a growing interest in data partitioning techniques and strategies. In fact, application performance can be heavily affected by how data are partitioned, which in turn depends on the selected size for data blocks, i.e. the block size. Therefore, finding an effective partitioning, i.e. a suitable block size, is a key strategy to speed-up parallel data-intensive applications and increase scalability. This paper describes a methodology, namely BLEST-ML (BLock size ESTimation through Machine Learning), for block size estimation that relies on supervised machine learning techniques. The proposed methodology was evaluated by designing an implementation tailored to dislib, a distributed computing library highly focused on machine learning algorithms built on top of the PyCOMPSs framework. We assessed the effectiveness of the provided implementation through an extensive experimental evaluation considering different algorithms from dislib, datasets, and infrastructures, including the MareNostrum 4 supercomputer. The results we obtained show the ability of BLEST-ML to efficiently determine a suitable way to split a given dataset, thus providing a proof of its applicability to enable the efficient execution of data-parallel applications in high performance environments.
format Preprint
id arxiv_https___arxiv_org_abs_2211_10819
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Block size estimation for data partitioning in HPC applications using machine learning techniques
Cantini, Riccardo
Marozzo, Fabrizio
Orsino, Alessio
Talia, Domenico
Trunfio, Paolo
Badia, Rosa M.
Ejarque, Jorge
Vazquez, Fernando
Distributed, Parallel, and Cluster Computing
Artificial Intelligence
The extensive use of HPC infrastructures and frameworks for running dataintensive applications has led to a growing interest in data partitioning techniques and strategies. In fact, application performance can be heavily affected by how data are partitioned, which in turn depends on the selected size for data blocks, i.e. the block size. Therefore, finding an effective partitioning, i.e. a suitable block size, is a key strategy to speed-up parallel data-intensive applications and increase scalability. This paper describes a methodology, namely BLEST-ML (BLock size ESTimation through Machine Learning), for block size estimation that relies on supervised machine learning techniques. The proposed methodology was evaluated by designing an implementation tailored to dislib, a distributed computing library highly focused on machine learning algorithms built on top of the PyCOMPSs framework. We assessed the effectiveness of the provided implementation through an extensive experimental evaluation considering different algorithms from dislib, datasets, and infrastructures, including the MareNostrum 4 supercomputer. The results we obtained show the ability of BLEST-ML to efficiently determine a suitable way to split a given dataset, thus providing a proof of its applicability to enable the efficient execution of data-parallel applications in high performance environments.
title Block size estimation for data partitioning in HPC applications using machine learning techniques
topic Distributed, Parallel, and Cluster Computing
Artificial Intelligence
url https://arxiv.org/abs/2211.10819