Comparison of Mesh and Hierarchical Networks for Multiprocessors

Upper bounds on message delay and throughput are developed for two networks that have been used in recent multiprocessor systems. Two-dimensional mesh networks with bidirectional links and no end-around connections are compared to bus-type hierarchical networks that use segmented rings for the inter...

Full description

Saved in:
Bibliographic Details
Published in1994 International Conference on Parallel Processing Vol. 1 Vol. 1; pp. 67 - 71
Main Authors Hamacher, V. Carl, Jiang, Hong
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.1994
Subjects
Bidirectional control
Computer science
Costs
Hardware
Mesh networks
Multiprocessor interconnection networks
Operating systems
Parallel processing
Switches
Throughput
Online AccessGet full text

Cover

More Information
Summary:Upper bounds on message delay and throughput are developed for two networks that have been used in recent multiprocessor systems. Two-dimensional mesh networks with bidirectional links and no end-around connections are compared to bus-type hierarchical networks that use segmented rings for the interconnection paths at each level of the hierarchy. Wormhole routing of short, fixed-length messages is used in the mesh networks, while a complete message can be switched between ring segments in one switch time in the hierarchical networks. It is found that three-level hierarchical systems perform somewhat better than mesh systems with respect to the basic bounds criteria that are developed.
ISBN:0849324939
9780849324932
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPP.1994.69