Abstract
Novel topological measures for static multiprocessor interconnection networks,disconnectivity, looseness, andcost-effectiveness, are developed. These and other measures are employed for a comparative analysis of such networks. The goal of this analysis is to predict network effectiveness, without resorting to execution benchmark techniques. In particular, we compare thehypercube andperfectshuffle-nearest-neighbor networks, and show that they are the best candidates for multiprocessor interconnections. We specifically find that the hypercube is capable of somewhat better performance than perfect-shuffle-nearest-neighbor, but the latter is significantly more cost-effective.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. W. Hockney and C. R. Jesshope, Parallel Computers, Adam Hilger Ltd., Bristol (1980).
K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill Book Co., New York (1984).
C. L. Seitz, Ensemble Architectures for VLSI-A Survey and Taxanomy,Proc. Conf. Adv. Res. in VLSI, Massachusetts Institute of Technology, pp. 130–135 (1982).
J. T. Schwartz, Ultracomputers,ACM Trans. Prog. Lang. Sys.,2(4):484–521 (1980).
H. S. Stone, Parallel Processing with the Perfect Shuffle,IEEE Trans. on Computers, Vol. C-20, No. 2, pp. 153–161 (1971).
C. L. Seitz, The Cosmic Cube,Comm. ACM,28(1):22–33 (1985).
C. L. Seitz, Concurrent VLSI Architectures,IEEE Trans. on Computers,C-33 (12):1247–1265 (1984).
R. Ginosar, and D. Egozi, Algorithmic Comparison of Hypercubes and Perfect-Nearest-Neighbor Networks Technical Report, Dept. of Electrical Engineering, Technion, Haifa, Israel, (1987).
C. H. Ng, FIFO Buffering Transceiver: A Communication Chip Set for Multiprocessor Systems, MSc Thesis, Dept. of Computer Science, California Institute of Technology, Pasadena, California (1982).
Y. Rimoni, I. Zisman, R. Ginosar, and U. Weiser, Communication Element for the Versatile MultiComputer,Proc. 15th IEEE Israel Conf., pp. 2.1.2 (1987).
R. J. Swan, S. H. Fuller, and D. P. Siewiorek, Cm*: A Modular Multimicroprocessor,Proc. AFIPS NCC, No. 46, pp. 637–644 (1977).
C. H. Sequin, and R. M. Fujimoto, X-Tree and Y-ComponentsVLSI Architecture, (eds.), B. Randell and P. C. Treleaven, pp. 471–480, Prentice-Hall, New Jersey (1983).
A. M. Despain, and D. A. Patterson, X-TREE: A Tree Structured Multiprocessor Computer Architecture,Proc. 5th An. Symp. Computer Architecture, pp. 144–151 (1978).
Intel. Corp., iPSC Documentation (1985).
Bolt Beranek and Newman Inc., Butterfly Parallel Processing Computer, Cambridge, Massachusetts (1986).
G. F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. Kleinfelder, K. P. McAuliffe, E. A. Melton, V. A. Norton, and J. Weiss, The IBM Research Parallel Prototype (RP3): Introduction and Architecture,Proc. Int'l. Conf. on Parallel Processing, pp. 764–771 (1985).
M. C. Sejnowski, E. T. Upchurch, R. N. Kapur, D. P. S. Charlu, and G. J. Lipovski, An Overview of the Texas Reconfigurable Array Computer (TRAC),Proc. AFIPS NCC, No. 49, pp. 631–641 (1980).
D. Gajski, D. Kuck, and D. Lawrie, CEDAR: A Large Scale Multiprocessor,ACM SIGARCH Computer Architecture News,11(1):7–11 (1983).
B. W. Arden and R. Cinosar, MP/C: A Multiprocessor/Computer Architecture,IEEE Trans. on Computers,C-31(5):455–473 (1982).
C. K. Baru and S. Y. W. Su, The Architecture of SM3: A Dynamically Partitionable Multicomputer System,IEEE Trans. on Computer,C-35(9):790–802 (1986).
P. Kermani, and L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique,Computer Networks,3(4):267–286 (1979).
T. Y. Feng, A Survey of Interconnection Networks,IEEE Computer, pp. 12–27 (December 1981).
F. P. Preparata and J. E. Vuillemin, The Cube-connected Cycles: A Versatile Network for Parallel Computation,Comm. ACM 24(6):300–309 (1981).
B. W. Arden and H. Lee, A Regular Network for Multicomputer System,IEEE Trans. on Computers,C-31(1):60–69 (1982).
J. R. Goodman and C. H. Sequin, Hypertree: A Multiprocessor Interconnection Topology,IEEE Trans. on Computer,C-30(12):923–933 (1981).
R. A. Finkel and M. H. Solomon, The Lens Interconnection Strategy,IEEE Trans. on Computer,C-30(12):960–965 (1981).
K. W. Doty, New Designs for Dense Processor Interconnection Networks,IEEE Trans. on Computer,C-33(5):447–450 (1984).
F. T. Leighton, Complexity Issues In VLSI, MIT Press, Cambridge, Massachusetts (1983).
S. A. Browning, The Tree Machine: A Highly Concurrent Computing Environment, Ph. D. Thesis, Dept. of Computer Science, Californa Institute Technology, Pasadena, California (1980).
B. W. Arden and H. Lee, Analysis of Chordal Ring Networks,IEEE Trans. on Computers,C-30(4):291–295 (1981).
C. R. Lang, The Extension of Object Oriented Languages to a Homogeneous Concurrent Architecture,” Ph. D. Thesis, California Institute Technology, Pasadena, California (1982).
A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU Ultracomputer-designing an MIMD shared memory parallel computer,IEEE Trans. on Computer,C-32(2):175–189 (1983).
Y. Shiloach and Vishkin U., Finding the Maximum Merging and Sorting in a Parallel Computation Model,J. of Algorithms,2(1):88–102 (1981).
C. D. Thompson, A Complexity Theory for VLSI, Ph. D. Thesis, Dept. of Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pennsylvania (1980).
C. E. Leiserson, Area-Efficient VLSI Computation, MIT Press, Cambridge, Massachusetts (1983).
C. R. Jesshope, private communication (December 1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ginosar, R., Egozi, D. Topological comparison of perfect shuffle and hypercube. Int J Parallel Prog 18, 37–68 (1989). https://doi.org/10.1007/BF01409745
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01409745