Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems

DOI10.1080/00207169908804790zbMath0934.68015OpenAlexW2080806579WikidataQ126256516 ScholiaQ126256516MaRDI QIDQ4254589

Keqin Li

Publication date: 29 June 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804790

zbMATH Keywords

distributed computingdynamic load distribution

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

Analysis of randomized load distribution for reproduction trees in linear arrays and rings ⋮ Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks ⋮ A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

Cites Work

• Taking random walks to grow trees in hypercubes
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Dynamic Tree Embeddings in Butterflies and Hypercubes
• Unnamed Item

This page was built for publication: Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems