Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1708591 | Applied Mathematics Letters | 2012 | 9 Pages |
Abstract
We analyze a new class of interconnection networks that are constructed by interlacing bypass rings to the torus network (iBT network). We establish the minimum conditions a bypass scheme needs to satisfy for generating a qualified iBT network and then we develop a recursive algorithm to calculate all of the qualified bypass schemes for a given network size and node degree. Our algorithm enables us to discover a class of the most efficient networks with up to 1 million nodes when considering the diameters of various iBT networks as a function of the bypass schemes. These analyses help achieve maximal performance improvement by the best bypass schemes.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Peng Zhang, Yuefan Deng,