Suboptimal communication schedule for GEN_BLOCK redistribution: (Best Student Paper Award: Honourable Mention)

Hyun Gyoo Yook, Myong Soon Park

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

Abstract

This article is devoted to the redistribution of one-dimensional arrays that are distributed in a GEN_BLOCK fashion over a processor grid. While GEN_BLOCK redistribution is essential for load balancing, prior research about redistribution has been focused on block-cyclic redistribution. The proposed scheduling algorithm exploits a spatial locality in message passing from a seemingly irregular array redistribution. The algorithm attempts to obtain near optimal scheduling by trying to minimize communication step size and the number of steps. According to experiments on CRAY T3E and IBM SP2, the algorithm shows good performance in typical distributed memory machines.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages100-113
Number of pages14
Volume1981
ISBN (Print)3540419993, 9783540419990
Publication statusPublished - 2001
Event4th International Conference on Vector and Parallel Processing, VECPAR 2000 - Porto, Portugal
Duration: 2000 Jun 212000 Jun 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1981
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Vector and Parallel Processing, VECPAR 2000
CountryPortugal
CityPorto
Period00/6/2100/6/23

Fingerprint

Redistribution
Schedule
Students
Communication
Message passing
Scheduling algorithms
Resource allocation
Scheduling
Data storage equipment
Optimal Scheduling
Distributed Memory
Message Passing
Load Balancing
Scheduling Algorithm
Locality
Experiments
Irregular
Grid
Minimise
Experiment

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yook, H. G., & Park, M. S. (2001). Suboptimal communication schedule for GEN_BLOCK redistribution: (Best Student Paper Award: Honourable Mention). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1981, pp. 100-113). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1981). Springer Verlag.

Suboptimal communication schedule for GEN_BLOCK redistribution : (Best Student Paper Award: Honourable Mention). / Yook, Hyun Gyoo; Park, Myong Soon.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1981 Springer Verlag, 2001. p. 100-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1981).

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

Yook, HG & Park, MS 2001, Suboptimal communication schedule for GEN_BLOCK redistribution: (Best Student Paper Award: Honourable Mention). in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1981, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1981, Springer Verlag, pp. 100-113, 4th International Conference on Vector and Parallel Processing, VECPAR 2000, Porto, Portugal, 00/6/21.
Yook HG, Park MS. Suboptimal communication schedule for GEN_BLOCK redistribution: (Best Student Paper Award: Honourable Mention). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1981. Springer Verlag. 2001. p. 100-113. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yook, Hyun Gyoo ; Park, Myong Soon. / Suboptimal communication schedule for GEN_BLOCK redistribution : (Best Student Paper Award: Honourable Mention). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1981 Springer Verlag, 2001. pp. 100-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a4674e932d154fb990ebec61706625dc,
title = "Suboptimal communication schedule for GEN_BLOCK redistribution: (Best Student Paper Award: Honourable Mention)",
abstract = "This article is devoted to the redistribution of one-dimensional arrays that are distributed in a GEN_BLOCK fashion over a processor grid. While GEN_BLOCK redistribution is essential for load balancing, prior research about redistribution has been focused on block-cyclic redistribution. The proposed scheduling algorithm exploits a spatial locality in message passing from a seemingly irregular array redistribution. The algorithm attempts to obtain near optimal scheduling by trying to minimize communication step size and the number of steps. According to experiments on CRAY T3E and IBM SP2, the algorithm shows good performance in typical distributed memory machines.",
author = "Yook, {Hyun Gyoo} and Park, {Myong Soon}",
year = "2001",
language = "English",
isbn = "3540419993",
volume = "1981",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "100--113",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Suboptimal communication schedule for GEN_BLOCK redistribution

T2 - (Best Student Paper Award: Honourable Mention)

AU - Yook, Hyun Gyoo

AU - Park, Myong Soon

PY - 2001

Y1 - 2001

N2 - This article is devoted to the redistribution of one-dimensional arrays that are distributed in a GEN_BLOCK fashion over a processor grid. While GEN_BLOCK redistribution is essential for load balancing, prior research about redistribution has been focused on block-cyclic redistribution. The proposed scheduling algorithm exploits a spatial locality in message passing from a seemingly irregular array redistribution. The algorithm attempts to obtain near optimal scheduling by trying to minimize communication step size and the number of steps. According to experiments on CRAY T3E and IBM SP2, the algorithm shows good performance in typical distributed memory machines.

AB - This article is devoted to the redistribution of one-dimensional arrays that are distributed in a GEN_BLOCK fashion over a processor grid. While GEN_BLOCK redistribution is essential for load balancing, prior research about redistribution has been focused on block-cyclic redistribution. The proposed scheduling algorithm exploits a spatial locality in message passing from a seemingly irregular array redistribution. The algorithm attempts to obtain near optimal scheduling by trying to minimize communication step size and the number of steps. According to experiments on CRAY T3E and IBM SP2, the algorithm shows good performance in typical distributed memory machines.

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

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

M3 - Conference contribution

AN - SCOPUS:84957837739

SN - 3540419993

SN - 9783540419990

VL - 1981

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 100

EP - 113

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -