|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| J. Misic, Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 7, pp. 678-687, July, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/71.296314, author = {J. Misic and Z. Jovanovic}, title = {Communication Aspects of the Star Graph Interconnection Network}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {7}, issn = {1045-9219}, year = {1994}, pages = {678-687}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.296314}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Communication Aspects of the Star Graph Interconnection Network IS - 7 SN - 1045-9219 SP678 EP687 EPD - 678-687 A1 - J. Misic, A1 - Z. Jovanovic, PY - 1994 KW - Index Termscomputational complexity; telecommunication channels; multiprocessor interconnectionnetworks; graph theory; communication algorithms; star graph interconnection network;hierarchical properties; sequences of generators; communication channels; timecomplexities; hypercube VL - 5 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
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.
[1] S. B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to then-cube,"Proc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 393-400.
[2] S. B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs,"Proc. 2nd Int. Conf. Supercomputing, vol. III, pp. 270-276, 1987.
[3] S. B. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks,"IEEE Trans. Comput., vol. 38, pp. 555-565, Apr. 1989.
[4] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[5] A. A. Chien and J. H. Kim, "Planar-adaptive routing: Low-cost adaptive networks for multiprocessors," inProc. 19th Int. Symp. Comput. Architecture, 1992, pp. 268-277.
[6] S. Chittor and R. Enbody, "Performance degradation in large wormhole-routed multicomputer networks,"Proc. 1990 Int. Conf. Parallel Processing, vol. I, pp. 424-428, Aug. 1990.
[7] W. J. Dally, "Virtual-channel flow control," inProc. 17th Annu. Int. Symp. Comput. Architecture, May 1990.
[8] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[9] C. J. Glass and L. M. Ni, "The turn model for adaptive routing," inProc. 19th Annu. Int. Symp. Comput. Architecture, May 1992, pp. 278-287.
[10] J. M. Hsu and P. Banerjee, "Hardware support for message routing in a distributed memory multicomputer,"Proc. 1990 Int. Conf. Parallel Processing, vol. I, pp. 508-515, Aug. 1990.
[11] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Networks, vol. 3, pp. 267-286, 1979.
[12] X. Lin and L.M. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks,"Proc. 18th Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 2146, 1991, pp. 116-125.
[13] J. Misic´and Z. Jovanovic´, "Routing function and deadlock avoidance in a star graph interconnection network," to appear inJ. Parallel Distrib. Computing, also available as Tech. Rep. TI-ETF-RTI-92-007, Univ. of Belgrade, Belgrade, Serbia, Yugoslavia, Mar. 1992.
[14] NCUBE Co.,NCUBE 6400 Processor Manual, 1990.
[15] S. F. Nugent, "The iPSC/2 Direct-Connect communications technology," inProc. Third Conf. Hypercube Comput. Appl., Pasadena, CA, Jan. 1988, pp. 56-60.
[16] Y. Saad and M. H. Schultz, "Data communications in parallel architectures,"Parallel Computing, vol. 11, pp. 131-150, Aug. 1989.