Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
From MaRDI portal
Publication:4254589
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
- Analysis of randomized load distribution for reproduction trees in linear arrays and rings
- scientific article; zbMATH DE number 1863320 (Why is no real title available?)
- Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
- Parallel Processing and Applied Mathematics
- scientific article; zbMATH DE number 1629981 (Why is no real title available?)
- 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)