The hyperstar interconnection network
From MaRDI portal
Recommendations
Cited in
(21)- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Node-ranking schemes for the star networks.
- Comparative study of product networks
- Study of general incomplete star interconnection networks
- The hierarchical cliques interconnection network
- EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
- Structural properties of hyper-stars.
- Embedding hypercubes, rings, and odd graphs into hyper-stars
- scientific article; zbMATH DE number 31767 (Why is no real title available?)
- scientific article; zbMATH DE number 1270450 (Why is no real title available?)
- Viable Architectures for High-Performance Computing
- Embedding star networks into hypercubes
- scientific article; zbMATH DE number 1983293 (Why is no real title available?)
- scientific article; zbMATH DE number 2040828 (Why is no real title available?)
- UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
- A star-based I/O-bounded network for massively parallel systems
- A network of hyperloops
- Performance modeling of Cartesian product networks
- Matrix representation of a Staran interconnecting network
- Analytic performance comparison of hypercubes and star graphs with implementation constraints
- Properties of a hierarchical network based on the star graph
This page was built for publication: The hyperstar interconnection network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388142)
