32 search results - page 4 / 7 » spaa 2003 |
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
SPAA
2003
ACM
14 years 1 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
14 years 1 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
SPAA
2003
ACM
14 years 1 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...