1515 search results - page 192 / 303 » Parallel computing on any desktop |
132
click to vote
EUROPAR
1997
Springer
15 years 8 months ago
1997
Springer
The large latency of memory accesses is a major obstacle in obtaining high processor utilization in large scale shared-memory multiprocessors. Access to remote memory is likely to ...
138
click to vote
PODC
1996
ACM
15 years 8 months ago
1996
ACM
We address the problem of the impossibility of implementing synchronous fault-tolerant service specifications in asynchronous distributed systems. We introduce a method for weaken...
125
click to vote
SPDP
1993
IEEE
15 years 8 months ago
1993
IEEE
- In this paper, we propose an optimal fault tolerant broadcasting algorithm which requires only n+1 steps for an SIMD hypercube with up to n-1 faulty nodes. The basic idea of the ...
132
click to vote
ICS
1994
Tsinghua U.
15 years 8 months ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
208
click to vote
PODC
1993
ACM
15 years 8 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...