Total exchange routing on hierarchical dual-nets
by Yamin Li; Wanming Chu
International Journal of Big Data Intelligence (IJBDI), Vol. 1, No. 4, 2014

Abstract: The hierarchical dual-net (HDN) is a newly proposed interconnection network for building extra large scale supercomputers. The HDN is constructed based on a symmetric product graph (called base network), such as three-dimensional torus and n-dimensional hypercubes. A k-level hierarchical dual-net, HDN(B, k, S), is obtained by applying k-time dual constructions on the base network B. S defines a supernode set that adjusts the scale of the system. The node degree of HDN(B, k, S) is d0 + k, where d0 is the node degree of the base network. The HDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. The total exchange, or all-to-all personalised communication, is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper, we show that the total exchange routing can be done on HDN efficiently and extra large scale HDNs can be implemented easily.

Online publication date: Sat, 24-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Big Data Intelligence (IJBDI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email