A comparison of homogeneous hierarchical interconnection structures

Author

Cantoni, Virginio ; Ferretti, Marco ; Lombardi, Luca

Author_Institution

Dipartimento di Inf. e Sistemistica, Pavia Univ., Italy

Volume

79

Issue

4

fYear

1991

fDate

4/1/1991 12:00:00 AM

Firstpage

416

Lastpage

428

Abstract

Among the various proposal advanced to build massive parallel systems in which the number of computing units ranges in the thousands, hierarchical topologies share a number of interesting properties. The authors review these architectures and their applicability and reliability, with particular attention to connections complexity and the ability to exchange messages. The usual assumption of the multiple instruction multiple data (MIMD) computational paradigm is as follows: autonomous but cooperating tasks execute on different processing units in the system. The overall complexity of the systems is measured with the analysis of the diameter and of the increasing law that states the number of interconnections against the number of nodes in the system. The various architectures are compared in terms of links load and average internode distance

Keywords

multiprocessor interconnection networks; parallel processing; performance evaluation; MIMD computational paradigm; average internode distance; connections complexity; homogeneous hierarchical interconnection structures; links load; massive parallel systems; reliability; Application software; Computer architecture; Computer vision; Concurrent computing; Large scale integration; Parallel processing; Proposals; Topology; Very large scale integration; Weather forecasting;

fLanguage

English

Journal_Title

Proceedings of the IEEE

Publisher

ieee

ISSN

0018-9219

Type

jour

DOI

10.1109/5.92037

Filename

92037