SPAA
2004
ACM
14 years 4 months 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...
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
SPAA
2004
ACM
14 years 4 months 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...
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only s...