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
来源
关键词
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 条
  • [21] Deadlock Avoidance for Interconnection Networks with Multiple Dynamic Faults
    Zarza, Gonzalo
    Lugones, Diego
    Franco, Daniel
    Luque, Emilio
    PROCEEDINGS OF THE 18TH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, 2010, : 276 - 280
  • [22] ROUTING FUNCTION AND DEADLOCK-AVOIDANCE IN A STAR GRAPH INTERCONNECTION NETWORK
    MISIC, J
    JOVANOVIC, Z
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 22 (02) : 216 - 228
  • [23] Routing in XD networks: A novel interconnection networks
    Gu, HX
    Liu, ZJ
    Qiu, ZL
    Tu, XX
    CHINESE JOURNAL OF ELECTRONICS, 2005, 14 (04): : 661 - 665
  • [24] Deadlock probability in unrestricted wormhole routing networks
    Folkestad, A
    Roche, C
    ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, 1997, : 1401 - 1405
  • [25] Software-based deadlock recovery technique for true fully adaptive routing in wormhole networks
    Martinez, JM
    Lopez, P
    Duato, J
    Pinkston, TM
    PROCEEDINGS OF THE 1997 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 1997, : 182 - 189
  • [26] MMAR: A deadlock recovery-based fault tolerant routing algorithm for mesh/torus networks
    Song, Lei
    Xu, Du
    Guo, Jiang
    Yao, Qing
    2007 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEMS; VOL 2: SIGNAL PROCESSING, COMPUTATIONAL INTELLIGENCE, CIRCUITS AND SYSTEMS, 2007, : 501 - +
  • [27] An analytical model of adaptive wormhole routing with deadlock recovery
    Ould-Khaoua, M
    Khonsari, A
    EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 900 - 903
  • [28] Polarized Routing for Large Interconnection Networks
    Camarero, Cristobal
    Martinez, Carmen
    Beivide, Ramon
    IEEE MICRO, 2022, 42 (02) : 61 - 67
  • [29] Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
    Freek Verbeek
    Julien Schmaltz
    Journal of Automated Reasoning, 2012, 48 : 419 - 439
  • [30] A formal model of message blocking and deadlock resolution in interconnection networks
    Warnakulasuriya, S
    Pinkston, TM
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2000, 11 (03) : 212 - 229