20 search results - page 1 / 4 » Minimizing average latency in oblivious routing |
SODA
2008
ACM
14 years 9 days ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
ICCD
2008
IEEE
14 years 7 months ago
2008
IEEE
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
ISCA
2009
IEEE
14 years 5 months ago
2009
IEEE
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
CAL
2008
13 years 11 months ago
2008
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
ISCA
2005
IEEE
14 years 4 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...