3047 search results - page 363 / 610 » Randomized Parallel Selection |
117
click to vote
ICS
1999
Tsinghua U.
15 years 7 months ago
1999
Tsinghua U.
The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically underutilize multi-...
123
click to vote
HCW
1998
IEEE
15 years 7 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
134
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper, the effect of switch design on the application performance of cache-coherent non-uniform memory access (CC-NUMA) multiprocessors is studied in detail. Wormhole rout...
160
click to vote
SPAA
1994
ACM
15 years 7 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
120
click to vote
PODC
1990
ACM
15 years 7 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...