Issue No. 07 - July (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.296314
<p>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.</p>
Index Termscomputational complexity; telecommunication channels; multiprocessor interconnectionnetworks; graph theory; communication algorithms; star graph interconnection network;hierarchical properties; sequences of generators; communication channels; timecomplexities; hypercube
Z. Jovanovic and J. Misic, "Communication Aspects of the Star Graph Interconnection Network," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 678-687, 1994.