Augmented k-ary n-cubes

نویسندگان

  • Yonghong Xiang
  • Iain A. Stewart
چکیده

We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n-cube AQn,k: is a Cayley graph, and so is vertex-symmetric, but not edge-symmetric unless n = 2; has connectivity 4n−2 and wide-diameter at most max{(n−1)k−(n−2), k+7}; has diameter ⌊ 3 ⌋+⌈ 3 ⌉, when n = 2; and has diameter at most k 4 (n+1), for n ≥ 3 and k even, and at most k 4 (n+1)+ n 4 , for n ≥ 3 and k odd. keywords: interconnection networks; parallel computing; k-ary n-cubes; augmented cubes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extra connectivity measures of 3-ary n-cubes

The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...

متن کامل

On the Performance Merits of Bypass Channels in Hypermeshes and k-Ary n-Cubes

Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topolo...

متن کامل

DDE: A Modified Dimension Exchange Method for Load Balancing in k-ary n-Cubes

| The dimension exchange method (DEM) was initially proposed as a load-balancing algorithm for the hypercube structure. It has been generalized to k-ary n-cubes. However, the k-ary n-cube algorithm must take many iterations to converge to a balanced state. In this paper, we propose a direct method to modify DEM. The new algorithm, Direct Dimension Exchange (DDE) method, takes load average in ev...

متن کامل

On 3-extra connectivity of k-ary n-cubes

Given a graph G, a non-negative integer g and a set of vertices S, the g-extra connectivity of G is the cardinality of a minimum set S such that G − S is disconnected and each component of G− S has at least g + 1 vertices. The 2-extra connectivity of k-ary n-cubes is gotten by Hsieh et al. in [Theoretical Computer Science, 443 (2012) 63-69] for k ≥ 4. This paper shows that the 3-extra connectiv...

متن کامل

Express Cubes: Improving the Performance of k-Ary n-Cube Interconnection Networks

Express cubes are k-ary n-cube interconnection networks augmented by express channels that provide a short path for non-local messages. An express cube combines the logarithmic diameter of an indirect network with the wire-efficiency and ability to exploit locality of a direct network. The insertion of express channels reduces the network diameter and thus the distance component of network late...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 181  شماره 

صفحات  -

تاریخ انتشار 2011