The role of storage target allocation in applications' I/O performance with BeeGFS - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

The role of storage target allocation in applications' I/O performance with BeeGFS

Résumé

Parallel file systems are at the core of HPC I/O infrastructures. Those systems minimize the I/O time of applications by separating files into fixed-size chunks and distributing them across multiple storage targets. Therefore, the I/O performance experienced with a PFS is directly linked to the capacity to retrieve these chunks in parallel. In this work, we conduct an in-depth evaluation of the impact of the stripe count (the number of targets used for striping) on the write performance of BeeGFS, one of the most popular parallel file systems today. We consider different network configurations and show the fundamental role played by this parameter, in addition to the number of compute nodes, processes and storage targets. Through a rigorous experimental evaluation, we directly contradict conclusions from related work. Notably, we show that sharing I/O targets does not lead to performance degradation and that applications should use as many storage targets as possible. Our recommendations have the potential to significantly improve the overall write performance of BeeGFS deployments and also provide valuable information for future work on storage target allocation and stripe count tuning.
Fichier principal
Vignette du fichier
main.pdf (519 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03753813 , version 1 (18-08-2022)

Identifiants

  • HAL Id : hal-03753813 , version 1

Citer

Francieli Boito, Guillaume Pallez, Luan Teylo. The role of storage target allocation in applications' I/O performance with BeeGFS. CLUSTER 2022 - IEEE International Conference on Cluster Computing, Sep 2022, Heidelberg, Germany. ⟨hal-03753813⟩
202 Consultations
288 Téléchargements

Partager

Gmail Facebook X LinkedIn More