hMDCE: The Hierarchical Multidimensional Directed Cycles Ensemble Network

Takashi YOKOTA  Hiroshi MATSUOKA  Kazuaki OKAMOTO  Hideo HIRONO  Shuichi SAKAI  

IEICE TRANSACTIONS on Information and Systems   Vol.E79-D   No.8   pp.1099-1106
Publication Date: 1996/08/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Architectures, Algorithms and Networks for Massively Parallel Computing)
Category: Interconnection Networks
interconnection networks,  hierarchical networks,  routing algorithms,  performance evaluation,  massively parallel computers,  multithreaded architecture,  

Full Text: PDF(704KB)
>>Buy this Article

This paper discusses a massively parallel interconnection scheme for multithreaded architecture and introduces a new class of direct interconnection networks called the hierarchical Multidimensional Directed Cycles Ensemble (hMDCE). Its suitability for massively parallel systems is discussed. The network is evolved from the Multidimensional Directed Cycles Ensemble (MDCE) network, where each node is substituted by lower-level sub-networks. The new network addresses some serious problems caused by the increasing scale of parallel systems, such as longer latency, limited throughput and high implementation cost. This paper first introduces the MDCE network and then presents and examines in detail the hierarchical MDCE network. Bisection bandwidth of hMDCE is considerably reduced from its ancestor MDCE and the network performs significantly higher throughput and lower latency under some practical implementation constraints. The gate count and delay time of the compiled circuit for the routing function are insignificant. These results reveal that the hMDCE network is an important candidate for massively parallel systems interconnection.