Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
A message passing coprocessor for distributed memory multicomputers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Deadlock-free multicast wormhole routing in multicomputer networks
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Routing function and deadlock avoidance in a star graph interconnection network
Journal of Parallel and Distributed Computing
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Balanced Spanning Trees in Complete and Incomplete Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A Theory for Total Exchange in Multidimensional Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Study of general incomplete star interconnection networks
Journal of Computer Science and Technology
Embedding Star Networks into Hypercubes
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Optimal Total Exchange in Cayley Graphs
IEEE Transactions on Parallel and Distributed Systems
Routing and Embeddings in Super Cayley Graphs
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Broadcasting on incomplete star graph interconnection networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Properties of a hierarchical network based on the star graph
Information Sciences: an International Journal
| Hi-index | 0.01 |
Basic communication algorithms for star graph interconnection networks are developed by using the hierarchical properties of the star graph, with the assumption that one inputchannel can drive only one output communication channel at a time. With this constraint,communication algorithms for each node can be expressed only as sequences ofgenerators corresponding to the communication channels. Sequences that are identicalexploit the symmetry and hierarchical properties of the star graph and can be easilyintegrated in communication hardware. Their time complexities are evaluated andcompared with the corresponding results for the hypercube.