The twisted crossed cube. (31st October 2015)

• Record Type: Journal Article
• Authors: Wang, Xinyang; Liang, Jiarong; Qi, Deyu; Lin, Weiwei
• Is Part Of: Concurrency and computation. Volume 28:Number 5(2016)
• Page Start: 1507
• Page End: 1526
• Publication Date: 2015-10-31
• Subjects: twisted crossed cube -- crossed cube -- dynamic crossed cube -- routing algorithm -- embedding strategy -- network diameter; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3707
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems. In this paper, we propose a new interconnection network called twisted crossed cube (TCQn ) and investigate its basic network properties in terms of the regularity, connectivity, fault tolerance, recursiveness, hamiltonicity and ability to simulate other architectures, and so on. Then, we develop an effective routing algorithm Route (u, v) for TCQn that takes no more than d(u, v) + 1 steps for any two nodes ( u, v ) to communicate with each other, and the routing process shows that the diameter, wide diameter, and fault‐tolerant diameter of TCQn are about half of the corresponding diameters of the equivalent hypercube with the same dimension. In the end, by combining TCQn with crossed cube (CQn ), we propose a preferable dynamic network structure, that is, the dynamic crossed cube, which has the same network diameter as TCQn /CQn and better properties in other respects, for example, its connection complexity is half of that of TCQn /CQn when the network scale is large enough, and the number of its average routing steps is also much smaller than that in TCQn /CQn . Copyright © 2015 John Wiley & Sons, Ltd.