Analysis of k-ary n-cubes with dimension-ordered routing

Author： Sarbazi-Azad H. Khonsari A. Ould-Khaoua M.

Publisher： Elsevier

ISSN： 0167-739X

Source： Future Generation Computer Systems, Vol.19, Iss.4, 2003-05, pp. : 493-502

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

By Wu M.Y. Shu W.

Journal of Parallel and Distributed Computing, Vol. 44, Iss. 1, 1997-07 ,pp. : 88-96

Academic Press

Access to resources Recommend Favorite

A queueing model for predicting message latency in uni-directional k-ary n-cubes with deterministic routing and non-uniform traffic

By Loucif Samia Ould Khaoua Mohamed Min Geyong

Cluster Computing, Vol. 10, Iss. 2, 2007-06 ,pp. : 229-239

Springer Publishing Company

Access to resources Recommend Favorite

On the k-ary hypercube

By Bettayeb S.

Theoretical Computer Science, Vol. 140, Iss. 2, 1995-04 ,pp. : 333-339

Elsevier

Access to resources Recommend Favorite

A Fast and Efficient Processor Management Scheme for k-ary n-cubes

By Yoo B.S. Das C.R.

Journal of Parallel and Distributed Computing, Vol. 55, Iss. 2, 1998-12 ,pp. : 192-214

Academic Press

Access to resources Recommend Favorite

Fast barrier synchronization in wormhole k-ary n-cube networks with multidestination worms

By Panda D.K.

Future Generation Computer Systems, Vol. 11, Iss. 6, 1995-10 ,pp. : 585-602

Elsevier

Access to resources Recommend Favorite