Sciweavers

478 search results - page 9 / 96
» Diameter and Center Computations in Networks
Sort
View
ANCS
2010
ACM
13 years 5 months ago
sNICh: efficient last hop networking in the data center
: sNICh: Efficient Last Hop Networking in the Data Center Kaushik Kumar Ram, Jayaram Mudigonda, Alan L. Cox, Scott Rixner, Partha Ranganathan, Jose Renato Santos HP Laboratories H...
Kaushik Kumar Ram, Jayaram Mudigonda, Alan L. Cox,...
SIGCOMM
2009
ACM
14 years 1 months ago
VL2: a scalable and flexible data center network
To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to...
Albert G. Greenberg, James R. Hamilton, Navendu Ja...
CONEXT
2010
ACM
13 years 5 months ago
LEGUP: using heterogeneity to reduce the cost of data center network upgrades
Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds ...
Andrew R. Curtis, S. Keshav, Alejandro Lópe...
ICS
2000
Tsinghua U.
13 years 11 months ago
Improving parallel system performance by changing the arrangement of the network links
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
Valentin Puente, Cruz Izu, José A. Gregorio...
ANOR
2002
88views more  ANOR 2002»
13 years 7 months ago
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
Horst W. Hamacher, Martine Labbé, Stefan Ni...