EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK

DOI10.1080/10637199808947379zbMath1051.68536OpenAlexW2011441072MaRDI QIDQ3146524

Khaled Day, Abdel-Elah Al-Ayyoub

Publication date: 12 September 2002

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199808947379

zbMATH Keywords

interconnection networklarge-scale multiprocessor systems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computer system organization (68M99)

Cites Work

• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Subcube matrix decomposition: A unifying view for LU factorization on multicomputers
• The hyperstar interconnection network
• Block-cyclic matrix triangulation on the Cartesian product of star graphs

This page was built for publication: EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK