Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
From MaRDI portal
Publication:4254589
DOI10.1080/00207169908804790zbMATH Open0934.68015OpenAlexW2080806579WikidataQ126256516 ScholiaQ126256516MaRDI QIDQ4254589FDOQ4254589
Authors: 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
Recommendations
- Analysis of randomized load distribution for reproduction trees in linear arrays and rings
- On the performance of randomized embedding of reproduction trees in static networks
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
- Taking random walks to grow trees in hypercubes
Cites Work
Cited In (8)
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
- Title not available (Why is that?)
- Analysis of randomized load distribution for reproduction trees in linear arrays and rings
- Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
- Parallel Processing and Applied Mathematics
- Title not available (Why is that?)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
- Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
This page was built for publication: Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254589)
