Embedding large complete binary trees in hypercubes with load balancing

DOI10.1006/JPDC.1996.0073zbMATH Open0855.68010OpenAlexW2051458086MaRDI QIDQ1923393

Kemal Efe

Publication date: 25 November 1996

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1996.0073

zbMATH Keywords

massively parallel computingfixed size hypercubes

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (4)

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube ⋮ Title not available (Why is that?) ⋮ Embedding complete binary trees in product graphs ⋮ A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

This page was built for publication: Embedding large complete binary trees in hypercubes with load balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923393)