Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PDCAT

2007

Springer

2007

Springer

The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. Metacube (MC) is an attractive IN that can connect extremely large number of nodes with small number of links, meanwhile it holds a short diameter and keeps the simplicity of routing algorithm. An MC(k, m) network can connect 2m2k +k nodes with m+k links per node, where k is the dimension of the high-level cubes (classes) and m is the dimension of the low-level cubes (clusters). For example, an MC(3,3) with 6 links per node can connect 227 , or 134,217,728, nodes. In this paper, we show that the Metacube is Hamiltonian and give an efﬁcient algorithm to construct a Hamiltonian cycle in Metacube networks.

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
PDCAT |

Authors |
Yamin Li, Shietung Peng, Wanming Chu |

Comments (0)