Optimal parallel execution of complete binary trees and grids into most popular interconnection networks

Author： Bampis E. Konig J.-C. Trystram D.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.147, Iss.1, 1995-08, pp. : 1-18

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

Dense edge-disjoint embedding of complete binary trees in interconnection networks

By Ravindran S. Gibbons A.M. Paterson M.S.

Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. : 325-342

Elsevier

Access to resources Recommend Favorite

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

By Heun V. Mayr E.W.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 8, 2001-08 ,pp. : 1110-1125

Academic Press

Access to resources Recommend Favorite

Optimal Embedding of Complete Binary Trees into Lines and Grid

By Heckmann R. Klasing R. Monien B. Unger W.

Journal of Parallel and Distributed Computing, Vol. 49, Iss. 1, 1998-02 ,pp. : 40-56

Academic Press

Access to resources Recommend Favorite

Optimal dimension-exchange token distribution on complete binary trees

By Houle M.E. Tempero E. Turner G.

Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. : 363-376

Elsevier

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite