SPAA
2003
ACM
13 years 9 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
When using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his c...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...