Information Disseminating Schemes and Their Fault Tolerance in Hypercubes
Svante Carlsson, Yoshihide Igarashi, Kumiko Kanai, Andrzej Lingas, Kinya Miura, Ola Petersson · Kyoto University Research Information Repository (Kyoto University) · 1991
We present schemes for disseminating information in the n-dimensional hypercube with some faulty nodes/edges.If each processor can send a message to.$t$ neighbors at each round, and if the number of faulty nodes/edges is $k(k