Scheduling communication requests traversing a switch : complexity and algorithms

Abstract : In this paper, we study the problem of scheduling file transfers through aswitch. This problem is at the heart of a model often used for large grid computations,where the switch represents the core of the network interconnectingthe various clusters that compose the grid. We establish several complexityresults, and we introduce and analyze various algorithms, from both a theoreticaland a practical perspective.
Document type :
Reports
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102309
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 11:09:05 AM
Last modification on : Friday, April 19, 2019 - 1:38:17 AM

File

RR2006-25.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102309, version 1

Collections

Citation

Matthieu Gallet, Yves Robert, Frédéric Vivien. Scheduling communication requests traversing a switch : complexity and algorithms. [Research Report] LIP RR-2006-25, Laboratoire de l'informatique du parallélisme. 2006, 2+26p. ⟨hal-02102309⟩

Share

Metrics

Record views

20

Files downloads

25