Analysis of randomized load distribution for reproduction trees in linear arrays and rings
type: Item
instance of: scholarly article
title: Analysis of randomized load distribution for reproduction trees in linear arrays and rings
zbMATH Open document ID: 1070.68014
author: Keqin Li
published in: Theoretical Computer Science
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2115291
zbMATH Keywords: Dynamic load distribution
zbMATH Keywords: Linear array
zbMATH Keywords: Randomized tree embedding
zbMATH Keywords: Reproduction tree
zbMATH Keywords: Ring
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.033
OpenAlex ID: W2010709067
cites work: Taking random walks to grow trees in hypercubes
cites work: Q3138971
cites work: Q4393310
cites work: Q5727090
cites work: Branch-and-bound and backtrack search on mesh-connected arrays of processors
cites work: Randomized parallel algorithms for backtrack search and branch-and-bound computation
cites work: Dynamic Tree Embeddings in Butterflies and Hypercubes
cites work: Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
cites work: A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
cites work: On the performance of randomized embedding of reproduction trees in static networks
cites work: Lower bounds for dynamic tree embedding in bipartite networks
cites work: Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
DOI: 10.1016/J.TCS.2004.03.033
description: scientific article; zbMATH DE number 2115291