Asymptotic performance analysis of randomized tree growing in meshes

被引：0
作者：
Li, KQ [1 ]
机构：
[1] SUNY Albany, Dept Math & Comp Sci, New Paltz, NY 12561 USA
来源：
PROCEEDINGS OF THE HIGH-PERFORMANCE COMPUTING (HPC'98) | 1998年
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We analyze the asymptotic performance of a random-walk algorithm on mesh networks. We give the exact value of the asymptotic performance ratio in embedding a wide class of trees on d-dimensional meshes with arbitrary dilation.
引用
收藏
页码：222 / 227
页数：6
相关论文
共 13 条
  • [1] BHATT S, 1991, PROCEEDINGS OF THE SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P344
  • [2] TAKING RANDOM-WALKS TO GROW TREES IN HYPERCUBES
    BHATT, S
    CAI, JY
    [J]. JOURNAL OF THE ACM, 1993, 40 (03) : 741 - 764
  • [3] KAKLAMANIS C, 1992, P ACM S PAR ALG ARCH, P118
  • [4] RANDOMIZED PARALLEL ALGORITHMS FOR BACKTRACK SEARCH AND BRANCH-AND-BOUND COMPUTATION
    KARP, RM
    ZHANG, YJ
    [J]. JOURNAL OF THE ACM, 1993, 40 (03) : 765 - 789
  • [5] DYNAMIC TREE EMBEDDINGS IN BUTTERFLIES AND HYPERCUBES
    LEIGHTON, FT
    NEWMAN, MJ
    RANADE, AG
    SCHWABE, EJ
    [J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (04) : 639 - 654
  • [6] LI K, 1998, P 6 HIGH PERF COMP S
  • [7] LI K, 1996, P 11 ACM S APPL COMP, P337
  • [8] LI K, 1997, P 9 INT C PAR DISTR, P470
  • [9] LI K, 1997, P 12 ANN ACM S APPL, P496
  • [10] LI K, 1997, P 11 ANN INT S HIGH, P199
12