Analysis of randomized load distribution for reproduction trees in linear arrays and rings

DOI10.1016/J.TCS.2004.03.033MaRDI QIDQ1885897zbMATH OpenOpenAlexFDO

Authors Keqin Li

Publication date 12 November 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.03.033

zbMATH Keywords

Dynamic load distributionLinear arrayRandomized tree embeddingReproduction treeRing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On the performance of randomized embedding of reproduction trees in static networks
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• Tight Bounds for On-Line Tree Embeddings
• scientific article; zbMATH DE number 1953112

Cites work

• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Dynamic Tree Embeddings in Butterflies and Hypercubes
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• scientific article; zbMATH DE number 432837 (Why is no real title available?)
• scientific article; zbMATH DE number 1161316 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• Lower bounds for dynamic tree embedding in bipartite networks
• On the performance of randomized embedding of reproduction trees in static networks
• Performance analysis for dynamic tree embedding in k-partite networks by a random walk
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Taking random walks to grow trees in hypercubes

Cited in

(5)

• scientific article; zbMATH DE number 4216785 (Why is no real title available?)
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• scientific article; zbMATH DE number 1953112 (Why is no real title available?)
• Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
• Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

This page was built for publication: Analysis of randomized load distribution for reproduction trees in linear arrays and rings

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