Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A New Deadlock Detection Mechanism in Wormhole Networks

웜홀 네트웍을 위한 새로운 교착상태 발견 기법

  • 이수정 (인천교육대학교 컴퓨터교육과)
  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

Deadlock recovery-based routing algorithms in wormhole networks have gained attraction due to low hardware complexity and high routing adaptability Progressive deadlock recovery techniques require a few dedicated resources to transmit deadlocked packets rather than killing them. Selection of deadlocked packets is primarily based on time-out value which should be carefully determined considering various traffic patterns or packet length. By its nature, current techniques using time-out accompany unignorable number of false deadlock detections especially in a heavy-loaded network or with long packet size. Moreover, when a deadlock occurs, more than one packet may be marked as deadlocked, which saturate the resources allocated for recovery. This paper proposes more accurate deadlock detection scheme which does not make use of time-out to declare deadlock. The proposed scheme reduces the probability to detect false deadlocks considerably. Furthermore, a single message is selected as deadlocked for each cycle of blocked messages, thereby eliminating recovery overheads.

웜홀 네트웍에서 교착상태의 복구를 기반으로 하는 라우팅 알고리즘은 간단한 하드웨어 구조와 높은 라우팅 적응성으로 인해 관심을 이끌었다. 진보적인 교착상태 복구 방안들은 교착상태에 속한 패킷들을 삭제하는 대신에 소수 전용 리소스들을 통해 전송한다. 교착상태에 속한 패킷은 타임아웃에 의해 선정하는데 다양한 트래픽 형태 및 패킷 길이를 고려하여 가장 바람직한 성능을 가져오는 제한 시간 값을 결정하기는 매우 어려운 일이다. 본질적으로, 타임아웃을 사용하는 현재의 방법들은 네트웍 부하가 심하거나 메시지 길이가 긴 경우에 교착상태의 존재를 잘못 판단할 가능성이 크다. 또한 교착상태가 발생할 경우, 하나 이상의 메시지가 교착상태로 판단되어 복구를 위해 마련된 자원을 과포화시킬 수 있다. 본 논문에서는 타임아웃을 사용하지 않고 보다 정확히 교착상태를 발견하는 방안을 제시한다. 제안한 방안은 교착 상태를 잘못 판단하는 확률을 현저히 낮출 수 있다. 또한 순환 구조를 이루는 대기 상태의 메시지들 중에서 하나만을 교착상태라고 선언함으로써 복구에 따른 부담을 감소시킨다.

Keywords

References

  1. K. M. Al-Tawil, M. Abd-El-Barr, and F. Ashraf, 'A survey and comparison of wormhole routing techniques in a mesh networks', IEEE Network, Vol. 11, No. 2, pp. 38-45, 1997 https://doi.org/10.1109/65.580917
  2. L. M. Ni and P. K. McKinley, 'A Survey of Wormhole Routing Techniques in Direct Networks', IEEE Computer, Vol. 26, No. 2, pp. 62-76, 1993 https://doi.org/10.1109/2.191995
  3. H. Park and D. P. Agrawal, 'Generic Methodologies for Deadlock-free Routing', Proc. of the 10th Int'l Parallel Processing Symp., pp. 638-643, 1996
  4. W. J. Dally and C. L. Seitz, 'Deadlock-free message routing in multiprocessor interconnection networks', IEEE Trans. Computers, Vol. C-36, No. 5, pp. 547-553, 1987 https://doi.org/10.1109/TC.1987.1676939
  5. G.-M. Chiu, 'The Odd-even Turn model for Adaptive Routing', IEEE Trans. Parallel and Distributed Systems, Vol. 11, No. 7, Jul. 2000 https://doi.org/10.1109/71.877831
  6. C. J. Glass and L. Ni, 'The Turn Model for Adaptive Routing in Multicomputer Networks', Int'l Symp. on Computer Architecture, pp. 278-287, May 1992
  7. W. J. Dally, 'Virtual Chanel Flow Control', IEEE Trans. Parallel and Distributed Systems, Vol. 3, No. 2, pp. 194-205, Mar. 1992 https://doi.org/10.1109/71.127260
  8. J. Duato, 'A New Theory of Deadlock-free Adaptive Routing in Wormhole Networks', IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 12, pp. 1320-1331, Dec. 1993 https://doi.org/10.1109/71.250114
  9. T. M. Pinkston and S. Warnakulasuriya, 'On Deadlocks in Interconnection Networks', Proc. of Int'l Symp. on Computer Architecture, pp. 38-49, 1997 https://doi.org/10.1145/264107.264127
  10. S. Warnakulasuriya and T. M. Pinkston, 'Characterization of deadlocks in interconnection networks', Proc. of the 11th Int. Parallel Processing Symposium, Apr. 1997 https://doi.org/10.1109/IPPS.1997.580852
  11. T. M. Pinkston, 'Flexible and Efficient Routing Based on Progressive Deadlock Recovery', IEEE Transactions on Computers, Jul. 1999 https://doi.org/10.1109/12.780873
  12. Anjan K. V. and T. M. Pinkston, 'DISHA: A Deadlock Recovery Scheme for Fully Adaptive Routing', The 9th Int'l Parallel Processing Symp., pp. 537-543, Apr. 1995
  13. Anjan K. V., T. M. Pinkston, and J. Duato, 'Generalized Theory for Deadlock-free Adaptive Wormhole Routing and its Application to Disha Concurrent', The 10th Int'l Parallel Processing Symp., pp. 815-821, 1996 https://doi.org/10.1109/IPPS.1996.508153
  14. J. M. Martinez, P. Lopez, J. Duato, and T. M. Pinkston, 'Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks', Int'l Conf. on Parallel Processing, 1997 https://doi.org/10.1109/ICPP.1997.622586
  15. P. Lopez, J. M. Martinez, and J. Duato, 'A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks', Proc. High Performance Computer Architecture Workshop, Feb. 1998 https://doi.org/10.1109/HPCA.1998.650546
  16. M. Thottethodi, A. R. Lebeck, and S. S. Muk-herjee, 'Self-Tuned Congestion Control for Multiprocessor Networks', Proc. the 7th Int'l Symp. on High-Performance Computer Architecture, 2001
  17. S. Wamakulasuriya and T. M. Pinkston, 'A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks', IEEE Trans. Parallel and Distributed Systems, Vol. 11, No. 3, pp. 212-229, Mar. 2000 https://doi.org/10.1109/71.841739