Paper Details

Reference:

Govindan Ravindran and Michael Stumm,
"Hierarchical ring and the effect of their bisection band-width constraints",
In Proceedings International Conference on Parallel Processing (ICPP'95), Urbana-Champain, IL, USA, 1, August, 1995, pp. 51–55.

Download:

PDF

Abstract:

Ring-based hierarchical networks are interesting alternatives to popular direct networks such as 2D meshes or tori. They allow for simple router designs, wider communications paths, and faster networks than their direct network counterparts. However, they have a constant bisection bandwidth, regardless of system size. In this paper, we present the results of a simulation study to determine how large hierarchical ring networks can become before their performance deteriorates due to their bisection bandwidth constraint. We show that a system with a maximum of 128 processors can sustain most memory access behaviors, but that larger systems can be sustained, only if their bisection bandwidth is increased.

Keywords:

hierarchical ring networks, Computer architecture, scalability, mesh networks, router design

BibTeX:

@inproceedings(Ravindran-ICPP95,
    author = {Govindan Ravindran and Michael Stumm},
    title = {Hierarchical ring and the effect of their bisection band-width constraints},
    booktitle = {Proceedings International Conference on Parallel Processing (\textbf{ICPP'95})},
    location = {Urbana-Champain, IL, USA},
    volume = {1},
    month = {August},
    year = {1995},
    pages = {51-55},
    keywords = {hierarchical ring networks, Computer architecture, scalability, mesh networks, router design}
)