Sciweavers

55 search results - page 7 / 11
» Oblivious Routing for the Lp-norm
Sort
View
CCCG
2006
14 years 11 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler
FOCS
2002
IEEE
15 years 2 months ago
Minimizing Congestion in General Networks
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
Harald Räcke
CAL
2008
14 years 10 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin
IPPS
2006
IEEE
15 years 3 months ago
Oblivious parallel probabilistic channel utilization without control channels
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
Christian Schindelhauer
ISCA
2003
IEEE
130views Hardware» more  ISCA 2003»
15 years 3 months ago
GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks
We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL - Globally Oblivious Adaptive Locally - that provides high throughput on adversarial traffic patt...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...