Skip to Main content Skip to Navigation
Conference papers

Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks

Emmanuel Jeannot 1 Frédéric Wagner 2
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study the problem of scheduling messages between two parallelmachines connected by a low latency network during a data redistribution. We compare two approaches. In the first approach no scheduling is performed. Since all the messages cannot be transmitted at the same time, the transport layer has to manage the congestion. In the second approach we use two higher-level scheduling algorithms proposed in our previous work [10] called GGP and OGGP. The contribution of this paper is the following: We show that the redistribution time with scheduling is always better than the brute-force approach (up to 30%). As this speedup depends on the input redistribution pattern, we propose a modelization of the behavior of both approaches and show that we are able to accurately predict the redistribution time with or without scheduling and thus able to choose for each pattern whether or not to schedule the communications.
Complete list of metadata
Contributor : Emmanuel Jeannot Connect in order to contact the contributor
Submitted on : Thursday, September 21, 2006 - 11:55:07 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM




Emmanuel Jeannot, Frédéric Wagner. Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks. The First International Symposium on Frontiers in Networking with Applications - FINA 2006 (AINA 2006 additional workshop), 2006, Vienna, Austria. pp.793-797, ⟨10.1109/AINA.2006.232⟩. ⟨inria-00097260⟩



Record views