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

DOI10.1016/j.tcs.2004.03.033zbMath1070.68014OpenAlexW2010709067MaRDI QIDQ1885897

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

Linear arrayRingDynamic load distributionRandomized tree embeddingReproduction tree

Mathematics Subject Classification ID

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

Related Items (1)

Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
• Lower bounds for dynamic tree embedding in bipartite networks
• On the performance of randomized embedding of reproduction trees in static networks
• 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
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

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