Fault tolerant broadcasting algorithms in SIMD hypercubes /

Abstract: "We study the problem of broadcasting in faulty SIMD hypercube multiprocessors subject to node failures. In a faulty SIMD hypercube of dimension n containing n - 1 or fewer faulty nodes, the best known broadcasting algorithm takes n + 12 steps to forward the message from a source no...

Full description

Bibliographic Details

Main Author:	Chang, Yeimkuan
Other Authors:	Bhuyan, Laxmi N.
Format:	Book
Language:	English
Published:	College Station, Tex. : Texas A & M University, Computer Science Dept., [1993]
Series:	Technical report (Texas A & M University. Computer Science Department) ; 93-044.
Subjects:	Fault-tolerant computing.