Escape and restoration routing: Suspensive deadlock recovery in interconnection networks

被引：0
|
作者：
Takabatake, T [1 ]
Kitakami, M
Ito, H
机构：
[1] Chiba Univ, Grad Sch Sci & Technol, Chiba 2638522, Japan
[2] Univ Tokyo, VLSI Design & Educ Ctr, Tokyo 1338656, Japan
[3] Chiba Univ, Fac Engn, Chiba 2638522, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2002年 / E85D卷 / 05期
关键词：
interconnection networks; suspensive deadlock recovery; fault-tolerant routing; escape; restoration;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In interconnection networks, deadlock recovery has been studied in routing strategy. The routing strategy for the deadlock recovery is intended to optimize the routing performance when deadlocks do not occur. On the other hand, it is important to improve the routing performance by handling deadlocks if they occur. In this paper, a routing strategy for suspensive deadlock recovery called an escape-restoration routing is proposed and it performance is evaluated. In the principle of the proposed techniques, a small amount of exclusive buffer (escape-buffer) at each router is prepared for handling one of deadlocked packets. The transmission of the packet is suspended by temporarily escaping it to the escape-buffer. After the other (leadlocked packets were sent. the suspended transmission resumes by restoring the escaped packet, Evaluation results show that the proposed technique can improve the routing performance more than that of the previous recovery-based techniques in handling deadlocks.
引用
收藏
页码：824 / 832
页数：9
相关论文
共 50 条
  • [1] Escape and restoration routing: Suspensive deadlock recovery in interconnection networks
    Takabatake, T
    Kitakami, M
    Ito, H
    2001 PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING, PROCEEDINGS, 2001, : 127 - 134
  • [2] Escape and restoration routing: Suspensive deadlock recovery in interconnection networks
    Takabatake, Toshinori
    Kitakami, Masato
    Ito, Hideo
    IEICE Transactions on Information and Systems, 2002, E85-D (05) : 824 - 832
  • [3] Deadlock avoidance and adaptive routing in interconnection networks
    Duato, J
    PROCEEDINGS OF THE SIXTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING - PDP '98, 1998, : 359 - 364
  • [4] DEADLOCK-FREE MESSAGE ROUTING IN MULTIPROCESSOR INTERCONNECTION NETWORKS
    DALLY, WJ
    SEITZ, CL
    IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (05) : 547 - 553
  • [5] A deadlock-free routing scheme for interconnection networks with irregular topologies
    Chi, HC
    Tang, CT
    1997 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1997, : 88 - 95
  • [6] A Deadlock-Free Dynamic Reconfiguration Protocol for Distributed Routing on Interconnection Networks
    Kadhar, Mohiadeen Abdul
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2014, 11 (06) : 616 - 622
  • [7] Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks
    Gaughan, PT
    Dao, BV
    Yalamanchili, S
    Schimmel, DE
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (06) : 651 - 665
  • [8] Efficient deadlock-free multi-dimensional interval routing in interconnection networks
    Královic, R
    Rovan, B
    Ruzicka, P
    Stefankovic, D
    DISTRIBUTED COMPUTING, 1998, 1499 : 273 - 287
  • [9] PDR: A new scheme of deadlock-free routing in mesh/torus interconnection networks
    Wang, H
    Zhu, XD
    Xu, D
    Li, LM
    2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 663 - 667
  • [10] Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks
    Khonsari, A
    Shahrabi, A
    Ould-Khaoua, M
    Sarbazi-Azad, H
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2003, 150 (02): : 97 - 106
12345