Name
Abstract | ||
|---|---|---|
We develop algorithms for performing total exchange (all-to-all broadcast) in an n-dimensional faulty SIMD hypercube, Qn, with up to n-1 node faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. We describe a sequence of algorithms which take N log N, N log n, 3N-7, 2.5N-7 steps for this problem. By carefully analyzing these algorithms and a property of certain ordering of dimensions, we obtain an improved algorithm which takes 2N steps |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/IPPS.1994.288206 | Cancun |
Keywords | Field | DocType |
hypercube networks,performance evaluation,all-to-all broadcast,faulty SIMD hypercubes,total exchange | Discrete mathematics,Broadcasting,Algorithm design,Supercomputer,Computer science,Parallel computing,SIMD,Robustness (computer science),Fault tolerance,Time complexity,Hypercube | Conference |
ISBN | Citations | PageRank |
0-8186-5602-6 | 5 | 0.60 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amit Sengupta | 1 | 8 | 1.72 |
| Raghavendra, C.S. | 2 | 27 | 4.17 |