Optimal oblivious routing on d-dimensional meshes

被引：0
|
作者：
Osterloh, A [1 ]
机构：
[1] Fern Univ Hagen, Fachbereich Informat, D-58084 Hagen, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2005年 / 333卷 / 03期
关键词：
parallel algorithm; oblivious routing; d-dimensional mesh; constant buffer size;
D O I：
10.1016/j.tcs.2004.04.016
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). We present an asymptotically optimal O(k-root n(d)) step oblivious k-k routing algorithm for d-dimensional n x(...)x n meshes of n(d) processors for all k >= 1 and d > 1. We further show how the algorithm can be used to achieve asymptotically optimal oblivious k-k routing algorithms on other networks. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：331 / 346
页数：16
相关论文
共 50 条
12345