22018 search results - page 4119 / 4404 » or 2004 |
169
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
201
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
179
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
174
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
194
click to vote
STOC
2004
ACM
16 years 3 days ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...