Conference proceeding
An algebraic theory for modeling direct interconnection networks
Proceedings Supercomputing '92, v 129723, pp 488-497
1992
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
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.< >
Metrics
Details
- Title
- An algebraic theory for modeling direct interconnection networks
- Creators
- S.D Kaushik - Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USAS Sharma - Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USAC.-H Huang - Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USAJ.R JohnsonR.W JohnsonP SadayappanIEEE, COMP SOC
- Publication Details
- Proceedings Supercomputing '92, v 129723, pp 488-497
- Conference
- Supercomputing '92
- Publisher
- IEEE Comput. Soc. Press
- Number of pages
- 1
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Marketing
- Web of Science ID
- WOS:A1992BY14K00050
- Scopus ID
- 2-s2.0-0011668675
- Other Identifier
- 991019173463104721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Engineering, Electrical & Electronic