An exchanged folded hypercube‐based topology structure for interconnection networks. (18th May 2015)

• Record Type: Journal Article
• Authors: Qi, Heng; Li, Yang; Li, Keqiu; Stojmenovic, Milos
• Is Part Of: Concurrency and computation. Volume 27:Number 16(2015:Nov.)
• Page Start: 4194
• Page End: 4210
• Publication Date: 2015-05-18
• Subjects: interconnection network -- topology -- hypercube -- exchanged folded hypercube; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3506
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: This paper focuses on the topology structure of interconnection networks. To overcome drawbacks in the existing hypercube structure, we present an exchanged folded hypercube ( EFH ) structure, which is an improvement of the exchanged hypercube. Compared with the existing hypercube structures, EFH shows better performance in terms of many metrics such as smaller diameter, lower cost factor, and constant node degree. In this paper, we first introduce the structure of an EFH ; then, we propose a routing algorithm and a load‐balancing algorithm for EFH s. Finally, we analyze the fault tolerance characteristics of EFH s including fault diameter and the cost effectiveness factor. Copyright © 2015 John Wiley & Sons, Ltd.