Sciweavers

6800 search results - page 1286 / 1360
» On optimizing collective communication
Sort
View
LCPC
2000
Springer
14 years 14 days ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
NGC
2000
Springer
125views Communications» more  NGC 2000»
14 years 14 days ago
A multicast-based protocol for IP mobility support
Several architectures have been recently proposed to support IP mobility. Most studies, however, show that current protocols, in general, fall short from satisfying the performanc...
Ahmed Helmy
FOCS
1995
IEEE
14 years 13 days ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
EENERGY
2010
14 years 6 days ago
Energy-aware traffic engineering
Energy consumption of the Internet is already substantial and it is likely to increase as operators deploy faster equipment to handle popular bandwidthintensive services, such as ...
Nedeljko Vasic, Dejan Kostic
GLOBECOM
2009
IEEE
14 years 4 days ago
Conjectural Equilibrium in Water-Filling Games
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
Yi Su, Mihaela van der Schaar
« Prev « First page 1286 / 1360 Last » Next »