A Mesh-of-Appendixed-Trees-Based Technique Carried on the Crossed Cube

Article Preview

Abstract:

In this paper, we show how a MAT (Mesh-of-Appendixed-Trees) embedded into the crossed cube which is a variant of hypercube. When we seek to implement this MAT-based mapping scheme on a crossed cube machine, we solve the two following questions: an N×N MAT can be embedded into a crossed cube of 4N2 nodes and the smallest size crossed cube to embody an N×N MAT has 4N2 nodes.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 383-390)

Pages:

1241-1245

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Q.M. Malluhi and Magdy A. Bayoumi and T.R.N. Rao, Efficient mapping of ANN on hypercube massively paraller machines, IEEE trans. Comput. vol. 44 (6), pp.769-778, (1995).

DOI: 10.1109/12.391184

Google Scholar

[2] Saad Y, Shultz H G, Topological properties of Hypercubes, IEEE Trans. Comput. vol. 37( 7), pp.867-872, (1988).

DOI: 10.1109/12.2234

Google Scholar

[3] K. Efe, The Crossed Cube Architecture for Parallel Computing, IEEE Trans. Parallel and Distributed Systems. vol. 3(5), pp.513-524, (1992).

DOI: 10.1109/71.159036

Google Scholar

[4] F. Harary, Graph Theory. Reading, MA: Addison-Wesley, (1972).

Google Scholar

[5] Jianxi Fan, Diagnosability of Crossed Cubes under the Comparison Diagnosis Model, IEEE Trans. Parallel and Distributed Systems. vol. 13(10), pp.1099-1104, (2002).

DOI: 10.1109/tpds.2002.1041887

Google Scholar