Semi-Distributed Coflow Scheduling in Datacenters - Archive ouverte HAL
Article Dans Une Revue IEEE Transactions on Network and Service Management Année : 2024

Semi-Distributed Coflow Scheduling in Datacenters

Résumé

With the advent of big data applications, coflow scheduling has become a cornerstone for the engineering of traffic in datacenters. Minimizing the average weighted Coflow Completion Times (CCT) is a crucial step to minimize the execution time of jobs running in distributed computing frameworks. In this paper, we present a new σ-order coflow scheduling solution, ONE-PARIS, an online semi-clairvoyant and semi-distributed implementation suitable to minimize the weighted CCT in production environments. We achieves this through ONE-PARIS scheduler for ordering coflows and a decentralized resource allocation mechanism, called Sync-Rate, enabling to respect the order of priority of coflows provided by ONE-PARIS and ensuring efficient synchronization between flows of the same coflow in order to free up bandwidth for low-priority flows. Extensive simulations on both synthetic and real traffics show that our proposed coflow scheduler outperforms other state-of-art schemes.
Fichier principal
Vignette du fichier
elazouzi2024semi.pdf (612.16 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04632942 , version 1 (03-07-2024)

Identifiants

Citer

Rachid El-Azouzi, Francesco De Pellegrini, Afaf Arfaoui, Cedric Richier, Jeremie Leguay, et al.. Semi-Distributed Coflow Scheduling in Datacenters. IEEE Transactions on Network and Service Management, In press, ⟨10.1109/TNSM.2024.3395992⟩. ⟨hal-04632942⟩

Collections

UNIV-AVIGNON LIA
16 Consultations
24 Téléchargements

Altmetric

Partager

More