1515 search results - page 128 / 303 » Parallel computing on any desktop |
71
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
104
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
133
click to vote
HPDC
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a techn...
168
Voted
ICDCS
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper evaluates the use of per-node multi-threading to hide remote memory and synchronization latencies in a software DSM. As with hardware systems, multi-threading in softwa...
114
click to vote
ICPP
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with k j ...