An algebraic theory for modeling direct interconnection networks

The authors present an algebraic theory based on tensor products for modeling direct interconnection networks. This theory has been used for designing and implementing block recursive numerical algorithms on shared-memory vector multiprocessors. This theory can be used for mapping algorithms express...

Full description

Saved in:
Bibliographic Details
Published in:Supercomputing, `92 pp. 488 - 497
Main Authors: Kaushik, S.D., Sharma, S., Huang, C.-H., Johnson, J.R., Johnson, R.W., Sadayappan, P.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1992
Subjects:
Algorithm design and analysis
Clouds
Computer science
Computerized monitoring
Concurrent computing
Data mining
Hypercubes
Multiprocessor interconnection networks
NIST
Tensile stress
ISBN:9780818626302, 0818626305
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The authors present an algebraic theory based on tensor products for modeling direct interconnection networks. This theory has been used for designing and implementing block recursive numerical algorithms on shared-memory vector multiprocessors. This theory can be used for mapping algorithms expressed in tensor product form onto distributed-memory architectures. The authors focus on the modeling of direct interconnection networks. Rings, n-dimensional meshes, and hypercubes are represented in tensor product form. Algorithm mapping using tensor product formulation is demonstrated by mapping matrix transposition and matrix multiplication onto different networks.< >
ISBN:9780818626302
0818626305
DOI:10.1109/SUPERC.1992.236655