Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching

MinHwan Ok, Myong Soon Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The hotspot seriously degrades the performance of a parallel algorithm but there have not been many methods proposed for this problem. Without modification of mesh topology a reasonable method is fully utilizing all the links of the hotspot node. A new routing method that incorporates both minimal routes and non-minimal routes was proposed and approved with the hotspot traffic patterns. In particular the routing method decide on misrouting without the congestion detection. The routing method requires only little addition of hardware and it is relatively simple.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsV. Malyshkin
Pages249-262
Number of pages14
Volume3606
Publication statusPublished - 2005
Event8th International Conference on Parallel Computing Technologies, PaCT 2005 - Krasnoyarsk, Russian Federation
Duration: 2005 Sep 52005 Sep 9

Other

Other8th International Conference on Parallel Computing Technologies, PaCT 2005
CountryRussian Federation
CityKrasnoyarsk
Period05/9/505/9/9

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Fingerprint Dive into the research topics of 'Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching'. Together they form a unique fingerprint.

  • Cite this

    Ok, M., & Park, M. S. (2005). Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching. In V. Malyshkin (Ed.), Lecture Notes in Computer Science (Vol. 3606, pp. 249-262)