Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures
1987 (English)In: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 4, no 2, 133-179 p.Article in journal (Refereed) Published
This paper presents a few algorithms for embedding loops and multidimensional arrays in hypercubes with emphasis on proximity preserving embeddings. A proximity preserving embedding minimizes the need for communication bandwidth in computations requiring nearest neighbor communication. Two storage schemes for "large" problems on "small" machines are suggested and analyzed and algorithms for matrix transpose, multiplying matrices, factoring matrices, and solving triangular linear systems are presented. A few complete binary tree embeddings are described and analyzed. The data movement in the matrix algorithms is analyzed and it is shown that in the majority of cases the directed routing paths intersect only at nodes of the hypercube allowing for a maximum degree of pipelining
Place, publisher, year, edition, pages
1987. Vol. 4, no 2, 133-179 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-91118OAI: oai:DiVA.org:kth-91118DiVA: diva2:508314
NR 201408052012-03-082012-03-08Bibliographically approved