Properties and performance of the block shift network

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 44, Issue 2, 1997, Pages 93-102

  Pan, Yi ^a   Chuang, Henry Y H ^b  

^a University of Dayton   (United States)

^b University of Pittsburgh   (United States)

Author keywords

Communication locality; Hypercube; Interconnection network; Performance evaluation; Time complexity

Indexed keywords

COMPUTER NETWORKS; ELECTRIC NETWORK PARAMETERS; ELECTRIC NETWORK TOPOLOGY; PARALLEL PROCESSING SYSTEMS; PARAMETER ESTIMATION; TELECOMMUNICATION LINKS;

BLOCK SHIFT NETWORK;

INTERCONNECTION NETWORKS;

EID: 0031078888     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.554320     Document Type: Article

References (33)

1. S. Abraham and E. S. Davidson, "A communication model for optimizing hierarchical multiprocessor systems," in 1986 Int. Conf. Parallel Proc., Aug. 1986, pp. 467-74.
2. S. Abraham and K. Padmanabhan, "An analysis of the twisted cube topology," in 1989 Int. Conf. Parallel Proc., Aug. 1989, pp. I-116-1-120.
3. D. P. Agrawal, V. K. Janakiram, and G. C. Pathak "Evaluating the performance of multicomputer configurations," IEEE Comput., vol. 19, pp. 23-37, May 1986.
4. S. B. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks," IEEE Trans. Comput., vol. 38, pp. 555-556, Apr. 1989.
5. B. W. Arden and H. Lee, "Analysis of chordal ring network," IEEE Trans. Comput., vol. C-30, pp. 291-295, Apr. 1981
6. C. Chen, D. P. Agrawal, and J. R. Burke, "A class of hierarchical networks for VLSI/WSI based multicomputers," in Proc. VLSI Design '91, Jan. 4-8, 1991, pp. 267-272.
7. H. L. Chen and N. F. Tzeng "Enhanced incomplete hypercubes," in 1989 Int. Conf. Parallel Proc., Aug. 1989, pp. I-270-I277.
8. Y. C. Chen, W. T. Chen, G. H. Chen, and J. P. Sheu, "Design efficient parallel algorithms on mesh-connected computers with multiple broadcasting," IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 241-245, Apr. 1990.
9. E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms," SIAM J. Comput., vol. 10, no. 4, pp. 657-675, 1981.
10. A. M. Despain and D. A. Patterson, "X-Tree: A tree structured multiprocessor computer architecture," in Proc. 5th Ann. Symp. Comp. Architect., Aug. 1978, pp. 144-151.
11. K. Efe, "A variation of the hypercube with lower diameter," IEEE Trans. Comput., vol. 40, pp. 1312-1316, Nov. 1991.
12. Z. Fang, X. Li, and L. Ni, "Parallel algorithms for 2-D convolution," IEEE Trans. Comput., vol. 30, pp. 184-194, Feb. 1989.
13. C. S. Ferner and K. Y. Lee, "Hyperbanyan networks: A new class of networks for distributed-memory multiprocessors," in The Fourth Symp. Frontiers of Massively Parallel Computat., Oct. 19-21, 1992, pp. 254-261.
14. E. Ganesan and D. K. Pradhan, "The hyper-deBruijn networks: Scalable versatile architecture," IEEE Trans. Parallel Distributed Syst., pp. 962-978, Sept. 1993.
15. K. Ghose and K. R. Desai, "The HCN: A versatile interconnection network based on cubes," Supercomputing '89, pp. 426-135, Nov. 1989.
16. M. Hamdi, "A class of recursive interconnection networks: Architectural characteristics and hardware cost," IEEE Trans. Circuits Syst. I, vol. 41, pp. 805-816, Dec. 1994.
17. K. Hwang and J. Ghosh, "Hypernet: A communication-efficient architecture for constructing massively parallel computers," IEEE Trans. Comput., vol. C-36, pp. 1450-1467, Dec. 1987.
18. H. P. Katseff, "Incomplete hypercube," IEEE Trans. Comput. vol. 37, pp. 604-608, May 1988.
19. K. H. Kwon, S. Latifi, and S. Q. Zheng, "Average data communication performance of twisted hypercubes," in Proc. Int. Conf. Finite Fields, Coding Theory, Advances in Commun. Comput., Dec. 1991, pp. 239-340.
20. S. Laksmivarahan and S. K. Dhall, "A new hierachy of hypercube interconnection schemes for parallel computers," J. Supercomput., pp. 81-107, Sept. 1988.
21. C. R. Lang, "The extension of object-oriented languages to a homogeneous concurrent architecture," Computer Sei. Dep., California Inst. Technol., TR-5014, May 1982.
22. S. Latifi and A. El-Amaway "Properties and performance of folded hypercube," IEEE Trans. Parallel Distributed Syst., vol. 2, pp. 31-12, Jan. 1991.
23. D. Nath, S. N. Maheshwari, and P. C. P. Bhat, "Efficient VLSI networks for parallel processing based on orthogonal trees," IEEE Trans. Comput., vol. C-32, 1983.
24. Y. Pan and H. H. Y. Chuang, "Highly parallel algorithms for singular value decomposition on hypercube SIMD machines," Comp. and Mathematics with Appl., vol. 24, no. 4, pp. 23-32, 1992.
25. _, "Parallel Hough transform algorithms on SIMD hypercube arrays," in 1990 Int. Conf. Parallel Proc., St. Charles, IL, Aug. 13-17, 1990.
26. Y. Pan, "The block shift network: Interconnection strategies for large parallel systems," Ph.D. dissertation, Dep. Comput. Sei., Univ. Pittsburgh, Aug. 1991.
27. Y. Pan and H. Y. H. Chuang, "Computations for some matrix and graph problems on the block shift network," in Proc. High Performance Comp. '94, San Diego, CA, Apr. 11-13, 1994, pp. 314-319.
28. F. P. Preparata and J. V. Vuillemin, "The cube connected cycles: A versatile network for parallel computers," CACM, vol. 24, pp. 300-309, May 1981.
29. S. Ranka and S. Sahni, "Computing Hough transform on hypercube multicomputers," J. Supercomput., vol. 4, no. 2, pp. 169-190.
30. M. R. Samanthan and D. K. Pradhan, "The DeBruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI," IEEE Trans. Comput., vol. 38, pp. 567-581, Apr. 1989.
31. I. D. Scherson, "Orthogonal graphs for the construction of a class of interconnection networks," IEEE Trans. Parallel Distributed Systems, vol. 2, no. 1, pp. 3-19, Jan. 1991.
32. H. S. Stone, "Parallel processing with the perfect shuffle," IEEE Trans. Comput., pp. 153-161, Feb. 1971.
33. A. Youssef and B. Narahari, "Banyan-hypercube networks," IEEE Trans. Parallel Distributed Syst., pp. 160-169, Apr. 1990.