Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
Yu-Wei Chen · 2005
Consider an n–dimensional SIMD hypercube Hn with � 3n/2 �− 1 faulty nodes. With n +3l og(n − 1) + 7, n +2 log(n − 1) + 9, n +l og(n − 1) + O(log log(n − 1)), n +l og(n − 1) + 12, and n +1 9 steps, this paper presents some one–to–all broadcasting algorithms on the faulty SIMD Hn .Th e sequence of dimensions used for broadcasting in each algorithm is the same regardless of which node is the source. The proposed one–to–all broad