Data movement techniques for the pyramid computer
SIAM Journal on Computing
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
On embedding rings into a star-related network
Information Sciences: an International Journal
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Wormhole broadcast in star graph networks
Parallel Computing
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Communication Aspects of the Star Graph Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Embedding longest fault-free paths onto star graphs with more vertex faults
Theoretical Computer Science
On Some Combinatorial Properties of the Star Graph
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Robustness of star graph network under link failure
Information Sciences: an International Journal
Substar Reliability Analysis in Star Networks
Information Sciences: an International Journal
Detecting Threats in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Algorithmic superactivation of asymptotic quantum capacity of zero-capacity quantum channels
Information Sciences: an International Journal
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
Hi-index | 0.07 |
This paper introduces a new class of interconnection networks named star-pyramid. An n-level star-pyramid is formed by piling up star graphs of dimensions 1 to n in a hierarchy, connecting any node in each i-dimensional star, 1