AN OPTIMAL TIME BOUND FOR OBLIVIOUS ROUTING

被引：2
|
作者：
PARBERRY, I
机构：
[1] Department of Computer Science, Whitmore Laboratory, The Pennsylvania State University, University Park, 16802, PA
来源：
ALGORITHMICA | 1990年 / 5卷 / 02期
关键词：
Normal algorithm; Oblivious; Parallel computation; Routing; Shuffle-exchange;
D O I：
10.1007/BF01840387
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The problem of routing data packets in a constant-degree network is considered. A routing scheme is called oblivious if the route taken by each packet is uniquely determined by its source and destination. The time required for the oblivious routing of n packets on n processors is known to be Θ(√n). It is demonstrated that the presence of extra processors can expedite oblivious routing. More specifically, the time required for the oblivious routing of n packets on p processors is Θ(n/√p + log n). © 1990 Springer-Verlag New York Inc.
引用
收藏
页码：243 / 250
页数：8
相关论文
共 50 条
  • [1] Optimal oblivious routing in polynomial time
    Azar, Y
    Cohen, E
    Fiat, A
    Kaplan, H
    Räcke, H
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 69 (03) : 383 - 394
  • [2] On improving optimal oblivious routing
    Scutella, Maria Grazia
    [J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (03) : 197 - 200
  • [3] A Lower Bound for Oblivious Dimensional Routing
    Osterloh, Andre
    [J]. EURO-PAR 2009: PARALLEL PROCESSING, PROCEEDINGS, 2009, 5704 : 1003 - 1010
  • [4] Optimal Oblivious Routing for Structured Networks
    Supittayapornpong, Sucha
    Namyar, Pooria
    Zhang, Mingyang
    Yu, Minlan
    Govindan, Ramesh
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1988 - 1997
  • [5] Optimal Oblivious Routing With Concave Objectives for Structured Networks
    Chitavisutthivong, Kanatip
    Supittayapornpong, Sucha
    Namyar, Pooria
    Zhang, Mingyang
    Yu, Minlan
    Govindan, Ramesh
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2023, 31 (06) : 2669 - 2681
  • [6] Optimal oblivious routing under linear and ellipsoidal uncertainty
    Pietro Belotti
    Mustafa Ç. Pınar
    [J]. Optimization and Engineering, 2008, 9 : 257 - 271
  • [7] Optimal oblivious routing under linear and ellipsoidal uncertainty
    Belotti, Pietro
    Pinar, Mustafa C.
    [J]. OPTIMIZATION AND ENGINEERING, 2008, 9 (03) : 257 - 271
  • [8] Optimal oblivious routing on d-dimensional meshes
    Osterloh, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 333 (03) : 331 - 346
  • [9] Optimal and Heuristic Application-Aware Oblivious Routing
    Kinsy, Michel A.
    Cho, Myong Hyon
    Shim, Keun Sup
    Lis, Mieszko
    Suh, G. Edward
    Devadas, Srinivas
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (01) : 59 - 73
  • [10] A lower bound for elementary oblivious routing on three-dimensional meshes
    Iwama, K
    Miyano, E
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 39 (02): : 145 - 161
12345