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

Fingerprint

Parallel algorithms
Telecommunication links
Topology
Hardware
Bandwidth

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

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)

Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching. / Ok, MinHwan; Park, Myong Soon.

Lecture Notes in Computer Science. ed. / V. Malyshkin. Vol. 3606 2005. p. 249-262.

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

Ok, M & Park, MS 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, 8th International Conference on Parallel Computing Technologies, PaCT 2005, Krasnoyarsk, Russian Federation, 05/9/5.
Ok M, Park MS. Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching. In Malyshkin V, editor, Lecture Notes in Computer Science. Vol. 3606. 2005. p. 249-262
Ok, MinHwan ; Park, Myong Soon. / Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching. Lecture Notes in Computer Science. editor / V. Malyshkin. Vol. 3606 2005. pp. 249-262
@inproceedings{3b7c3a82441c4eca8c485801982343d3,
title = "Minimizing hotspot delay by fully utilizing the link bandwidth on 2D mesh with virtual cut-through switching",
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.",
author = "MinHwan Ok and Park, {Myong Soon}",
year = "2005",
language = "English",
volume = "3606",
pages = "249--262",
editor = "V. Malyshkin",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

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

AU - Ok, MinHwan

AU - Park, Myong Soon

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=26844533304&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844533304&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:26844533304

VL - 3606

SP - 249

EP - 262

BT - Lecture Notes in Computer Science

A2 - Malyshkin, V.

ER -