Balakrishna J. Prabhu

Balakrishna J. Prabhu

Auto-generated profile, based on publicly available information

Balakrishna J. Prabhu

LAAS-CNRS, University of Toulouse, CNRS, Toulouse, France

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 November 2014 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
OBOlivier Brun
Olivier Brun
BPBalakrishna Prabhu
Balakrishna Prabhu

24 November 2017 in Queueing Systems
Verified
Journal Article
Closed access
PDF file
MJMatthieu Jonckheere
Matthieu Jonckheere
BPBalakrishna J. Prabhu
Balakrishna J. Prabhu

1 January 2014
Verified
Conference Paper
Closed access
OBOlivier Brun
Olivier Brun
BPBalakrishna J. Prabhu
Balakrishna J. Prabhu
TSTatiana Seregina
Tatiana Seregina

3 April 2024 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
OBOlivier Brun
Olivier Brun
Rachid El-AzouziRachid El-Azouzi
Rachid El-Azouzi
QLQuang-Trung Luu
Quang-Trung Luu
FPFrancesco De Pellegrini
Francesco De Pellegrini
BPBalakrishna J. Prabhu
Balakrishna J. Prabhu
CRCédric Richier
Cédric Richier
Datacenter networks commonly facilitate the transmission of data in distributed computing frameworks through coflows, which are collections of parallel flows associated with a common task. Most of the existing research has concentrated on scheduling coflows to minimize the time required for their completion, i.e., to optimize the average dispatch rate of coflows in the network fabric. Nevertheless, modern applications often produce coflows that are specifically intended for online services and mission-crucial computational tasks, necessitating adherence to specific deadlines for their completion. In this paper, we introduce $\mathtt {WDCoflow}$ , a new algorithm to maximize the weighted number of coflows that complete before their deadline. By combining a dynamic programming algorithm along with parallel inequalities, our heuristic solution performs at once coflow admission control and coflow prioritization, imposing a $\sigma$ -order on the set of coflows. With extensive simulation, we demonstrate the effectiveness of our algorithm in improving up to $3\times$ more coflows that meet their deadline in comparison the best SoA solution, namely $\mathtt {CS\rm{-}MHA}$ . Furthermore, when weights are used to differentiate coflow classes, $\mathtt {WDCoflow}$ is able to improve the admission per class up to $4\times$ , while increasing the average weighted coflow admission rate.

1 May 2018
Verified
Conference Paper
Closed access
TNThi Thu Hang Nguyen
Thi Thu Hang Nguyen
OBOlivier Brun
Olivier Brun
BPBalakrishna J. Prabhu
Balakrishna J. Prabhu

27 August 2011 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
Dieter FiemsDieter Fiems
Dieter Fiems
BPBalakrishna Prabhu
Balakrishna Prabhu
KTKoen De Turck
Koen De Turck