DocumentCode
2061205
Title
Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms
Author
Gallet, Matthieu ; Robert, Yves ; Vivien, Frédéric
Author_Institution
Lab. de rinformatique du Parallelisme, INRIA, Lyon
fYear
2007
fDate
7-9 Feb. 2007
Firstpage
39
Lastpage
46
Abstract
In this paper, we study the problem of scheduling file transfers through a switch. This problem is at the heart of a model often used for large grid computations, where the switch represents the core of the network interconnecting the various clusters that compose the grid. We establish several complexity results, and we introduce and analyze various algorithms, from both a theoretical and a practical perspective
Keywords
communication complexity; grid computing; scheduling; communication requests scheduling; file transfer scheduling; grid computations; Bandwidth; Communication switching; Grid computing; Heart; Heuristic algorithms; Internet; Processor scheduling; Scheduling algorithm; Spine; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel, Distributed and Network-Based Processing, 2007. PDP '07. 15th EUROMICRO International Conference on
Conference_Location
Napoli
ISSN
1066-6192
Print_ISBN
0-7695-2784-1
Type
conf
DOI
10.1109/PDP.2007.73
Filename
4135257
Link To Document