Sciweavers

32 search results - page 5 / 7
» spaa 2003
Sort
View
SPAA
2003
ACM
15 years 3 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
15 years 3 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
SPAA
2003
ACM
15 years 3 months ago
Compact routing with name independence
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan...
SPAA
2003
ACM
15 years 3 months ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...
SPAA
2003
ACM
15 years 3 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, ...