Resources placement in the 4-dimensional fault-tolerant hypercube processors network

In the paper some properties of the perfect resources placement in the 4dimensional hypercube sensors network with soft degradation are considered. The methods of determining some kind of perfect placement are discussed. Two algorithms for the resources deployment are proposed. Moreover, some characteristics of the network degradation are determined. The average number of processors working in degraded network with a given order for a specific type of resource placement is determined. This value characterizes the loss of the network computing capabilities resulting from the increase of the degree of network degradation. The probability distribution that there exists a specific type of resources placement for degraded logical structures of the hypercube with given order is evaluated, as well.

[1]  Wei,et al.  A Virtual Hypercube Routing Algorithm for Wireless Healthcare Networks , 2010 .

[2]  Z. Zieliński,et al.  Wyznaczanie struktur logicznych sieci procesorów o łagodnej degradacji i strukturze 4-wymiarowego hipersześcianu , 2012 .

[3]  Z. Zieliński,et al.  Metoda generowania struktur logicznych sieci procesorów o łagodnej degradacji typu 4-wymiarowego sześcianu , 2011 .

[4]  Tsutomu Ishikawa.  Hypercube Multiprocessors with Bus Connections for Improving Communication Performance , 1995, IEEE Trans. Computers.

[5]  Hamid Sarbazi-Azad,et al.  Resource placement in Cartesian product of networks , 2010, J. Parallel Distributed Comput..

[6]  Sun-Yuan Hsieh,et al.  Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model , 2010, SIAM J. Discret. Math..

[7]  Myung M. Bae,et al.  Resource Placement in Torus-Based Networks , 1997, IEEE Trans. Computers.

[8]  Isaac Keslassy,et al.  Statistical Approach to Networks-on-Chip , 2010, IEEE Transactions on Computers.

[9]  Bella Bose,et al.  On resource placements in 3D tori , 2003, J. Parallel Distributed Comput..

[10]  Nasser Yazdani,et al.  Resource Placement in Cube-Connected Cycles , 2008, 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008).

[11]  Hsing-Lung Chen,et al.  Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes , 1994, IEEE Trans. Computers.

[12]  Luca Benini,et al.  Synthesis of Predictable Networks-on-Chip-Based Interconnect Architectures for Chip Multiprocessors , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[13]  Jan Chudzikiewicz,et al.  Determining a Non-Collision Data Transfer Paths in Hypercube Processors Network , 2012 .

[14]  Bo-Yi Li,et al.  Hypercube-based Data Gathering in Wireless Sensor Networks , 2007, J. Inf. Sci. Eng..

[15]  Stefano Chessa,et al.  Reducing the number of sequential diagnosis iterations in hypercubes , 2004, IEEE Transactions on Computers.

[16]  Bella Bose,et al.  Quasi-perfect resource placements for two-dimensional toroidal networks , 2005, J. Parallel Distributed Comput..

[17]  Dajin Wang.  Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model , 1999, IEEE Trans. Computers.

[18]  J. Chudzikiewicz,et al.  Reconfiguration of a processor cube-type network , 2010 .

[19]  Nian-Feng Tzeng,et al.  Resource Allocation in Cube Network Systems Based on the Covering Radius , 1996, IEEE Trans. Parallel Distributed Syst..