14 search results - page 1 / 3 » Lower Bounds on Communication Loads and Optimal Placements i... |
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
ICS
2000
Tsinghua U.
13 years 9 months ago
2000
Tsinghua U.
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...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
IWQOS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...