Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
From MaRDI portal
Publication:1268832
DOI10.1006/jpdc.1998.1440zbMath0919.68005OpenAlexW2011337949MaRDI QIDQ1268832
Hong Shen, Si-Qing Zheng, Gilbert H. Young, Yi Pan, Keqin Li
Publication date: 1 November 1998
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1998.1440
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)
Related Items
Analysis of randomized load distribution for reproduction trees in linear arrays and rings, Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks, A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
