loading...
Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms
Naples, Italy February 07-February 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2007.7315th Euromicro International Conferen ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Matthieu Gallet, Yves Robert, Frederic Vivien, "Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 39-46, 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/PDP.2007.73,
author = {Matthieu Gallet and Yves Robert and Frederic Vivien},
title = {Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2007},
issn = {1066-6192},
pages = {39-46},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2007.73},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms
SN - 1066-6192
SP39
EP46
A1 - Matthieu Gallet,
A1 - Yves Robert,
A1 - Frederic Vivien,
PY - 2007
KW - null
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
Matthieu Gallet, UMR CNRS-ENS Lyon-INRIA-UCBL, France
Yves Robert, UMR CNRS-ENS Lyon-INRIA-UCBL, France
Frederic Vivien, UMR CNRS-ENS Lyon-INRIA-UCBL, France
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.
Citation:
Matthieu Gallet, Yves Robert, Frederic Vivien, "Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms," pdp, pp.39-46, 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions