Sciweavers

3 search results - page 1 / 1
» A case for random shortcut topologies for HPC interconnects
Sort
View
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
11 years 7 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
ICS
2009
Tsinghua U.
13 years 9 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
CORR
2011
Springer
157views Education» more  CORR 2011»
13 years 1 days ago
Convergence of type-symmetric and cut-balanced consensus seeking systems
We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining on...
Julien M. Hendrickx, John N. Tsitsiklis