Sciweavers

SPAA
2003
ACM
14 years 1 months ago
Quantifying instruction criticality for shared memory multiprocessors
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...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
SPAA
2003
ACM
14 years 1 months ago
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors
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...
Géraud Krawezik
SPAA
2003
ACM
14 years 1 months ago
Information gathering in adversarial systems: lines and cycles
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...
Kishore Kothapalli, Christian Scheideler
SPAA
2003
ACM
14 years 1 months ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
SPAA
2003
ACM
14 years 1 months ago
A polynomial-time tree decomposition to minimize congestion
Chris Harrelson, Kirsten Hildrum, Satish Rao
SPAA
2003
ACM
14 years 1 months ago
Cycle stealing under immediate dispatch task assignment
We consider the practical problem of task assignment in a server farm, where each arriving job is immediately dispatched to a server in the farm. We look at the benefit of cycle ...
Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, ...
SPAA
2003
ACM
14 years 1 months ago
TCP is competitive against a limited adversary
Jeff Edmonds, Suprakash Datta, Patrick W. Dymond
SPAA
2003
ACM
14 years 1 months ago
Asynchronous parallel disk sorting
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...
Roman Dementiev, Peter Sanders
SPAA
2003
ACM
14 years 1 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...