EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK

DOI10.1080/10637199808947379MaRDI QIDQ3146524zbMATH OpenOpenAlexFDO

Authors Abdel-Elah Al-Ayyoub, K. Day

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

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

Recommendations

• The hyperstar interconnection network
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
• scientific article; zbMATH DE number 2040828
• Hyper-star graph: A new interconnection network improving the network cost of the hypercube
• Node-ranking schemes for the star networks.

Cites work

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

Cited in

(6)

• The hyperstar interconnection network
• Node-ranking schemes for the star networks.
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
• Order preserving communication on a star network
• Efficient collective communications in dual-cube
• Analytic performance comparison of hypercubes and star graphs with implementation constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146524)