315 search results - page 4 / 63 » Dynamic vs. Oblivious Routing in Network Design |
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
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...
FTDCS
2004
IEEE
13 years 10 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
DAC
2006
ACM
14 years 3 days ago
2006
ACM
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
ICCAD
2004
IEEE
14 years 3 months ago
2004
IEEE
We propose two new FPGA routing switch designs that are programmable to operate in three different modes: highspeed, low-power or sleep. High-speed mode provides similar power an...