Issue No. 09 - September (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.29465
Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all-to-all broadcasting: distribution of common data from each node to all other nodes; and (4) all-
optimum broadcasting; personalized communication; hypercubes; Boolean n-cube configured multiprocessors; one-to-all broadcasting; one-to-all personalized communication; single node sending unique data; all-to-all broadcasting; all-to-all personalized communication; communication graphs; spanning trees; routing; scheduling; concurrent communication; complexity analysis; multiprocessor interconnection networks; scheduling.
S. Johnsson and C. Ho, "Optimum Broadcasting and Personalized Communication in Hypercubes," in IEEE Transactions on Computers, vol. 38, no. , pp. 1249-1268, 1989.