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 条
  • [32] Proof Pearl: A Formal Proof of Dally and Seitz' Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
    Verbeek, Freek
    Schmaltz, Julien
    JOURNAL OF AUTOMATED REASONING, 2012, 48 (04) : 419 - 439
  • [33] Performance of deadlock-free adaptive routing for hierarchical interconnection network TESH
    Horiguchi, S
    Miura, Y
    17TH IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT TOLERANCE IN VLSI SYSTEMS, PROCEEDINGS, 2002, : 275 - 283
  • [34] Flexible and efficient routing based on progressive deadlock recovery
    Pinkston, TM
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (07) : 649 - 669
  • [35] Deadlock-free routing in irregular networks using prefix routing
    Wu, Jie
    Sheng, Li
    Parallel Processing Letters, 2003, 13 (04) : 705 - 720
  • [36] DEADLOCK FREE WORMHOLE ROUTING IN A FAULTY TORUS NETWORKS
    Patni, Jagdish Chandra
    Tomar, Ravi
    Fore, Vivudh
    Aswal, M. S.
    2015 2ND INTERNATIONAL CONFERENCE ON COMPUTING FOR SUSTAINABLE GLOBAL DEVELOPMENT (INDIACOM), 2015, : 1034 - 1039
  • [37] DEADLOCK-FREE MESSAGE ROUTING IN MULTICOMPUTER NETWORKS
    HILBERS, PAJ
    LUKKIEN, JJ
    DISTRIBUTED COMPUTING, 1989, 3 (04) : 178 - 186
  • [38] Deadlock-Free Layered Routing for Infiniband Networks
    Kawano, Ryuta
    Matsutani, Hiroki
    Amano, Hideharu
    2019 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2019), 2019, : 84 - 90
  • [39] Synchronized Progress in Interconnection Networks (SPIN) : A New Theory for Deadlock Freedom
    Ramrakhyani, Aniruddh
    Gratz, Paul V.
    Krishna, Tushar
    2018 ACM/IEEE 45TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE (ISCA), 2018, : 699 - 711
  • [40] Synchronized Progress in Interconnection Networks (SPIN): A New Theory for Deadlock Freedom
    Ramrakhyani, Aniruddh
    Gratz, Paul V.
    Krishna, Tushar
    IEEE MICRO, 2019, 39 (03) : 110 - 117