Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms

Garng Morton Huang, W. Ongsakul

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

1 Citation (Scopus)

Abstract

In our earlier papers, the parallelization and implementations of Gauss-Seidel(G-S) power flow analysis have been investigated on both shared memory (SM) and distributed memory (DM) machines. The desired properties to maximize the speedup, such as the minimum communication overhead and the balancing computational load, have been described. In this paper, we investigate a two stage parallelization scheme to achieve the desired properties for the DM type machines. In the first stage, we introduce a new efficient heuristic clustering algorithm which reduces the communication time and balances the computational load. In the second stage, we devise a coloring algorithm which intends to minimize the synchronization overhead and coordinates the information exchange among processors. It is shown that the parallelization scheme effectively increases the speedups and the associated upper bound of G-S algorithm on the nCUBE2 machine.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages497-501
Number of pages5
ISBN (Print)0818656026
Publication statusPublished - 1 Jan 1994
Externally publishedYes
EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
Duration: 26 Apr 199429 Apr 1994

Other

OtherProceedings of the 8th International Parallel Processing Symposium
CityCancun, Mex
Period26/4/9429/4/94

Fingerprint

Data storage equipment
Communication
Coloring
Heuristic algorithms
Clustering algorithms
Synchronization

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Huang, G. M., & Ongsakul, W. (1994). Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms. In Proceedings of the International Conference on Parallel Processing (pp. 497-501). Publ by IEEE.

Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms. / Huang, Garng Morton; Ongsakul, W.

Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1994. p. 497-501.

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

Huang, GM & Ongsakul, W 1994, Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms. in Proceedings of the International Conference on Parallel Processing. Publ by IEEE, pp. 497-501, Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mex, 26/4/94.
Huang GM, Ongsakul W. Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms. In Proceedings of the International Conference on Parallel Processing. Publ by IEEE. 1994. p. 497-501
Huang, Garng Morton ; Ongsakul, W. / Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms. Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1994. pp. 497-501
@inproceedings{356a875d836c43a0ba14da8814e0296e,
title = "Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms",
abstract = "In our earlier papers, the parallelization and implementations of Gauss-Seidel(G-S) power flow analysis have been investigated on both shared memory (SM) and distributed memory (DM) machines. The desired properties to maximize the speedup, such as the minimum communication overhead and the balancing computational load, have been described. In this paper, we investigate a two stage parallelization scheme to achieve the desired properties for the DM type machines. In the first stage, we introduce a new efficient heuristic clustering algorithm which reduces the communication time and balances the computational load. In the second stage, we devise a coloring algorithm which intends to minimize the synchronization overhead and coordinates the information exchange among processors. It is shown that the parallelization scheme effectively increases the speedups and the associated upper bound of G-S algorithm on the nCUBE2 machine.",
author = "Huang, {Garng Morton} and W. Ongsakul",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "0818656026",
pages = "497--501",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Efficient task allocation algorithms and its use to parallelize irregular Gauss-Seidel type algorithms

AU - Huang, Garng Morton

AU - Ongsakul, W.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - In our earlier papers, the parallelization and implementations of Gauss-Seidel(G-S) power flow analysis have been investigated on both shared memory (SM) and distributed memory (DM) machines. The desired properties to maximize the speedup, such as the minimum communication overhead and the balancing computational load, have been described. In this paper, we investigate a two stage parallelization scheme to achieve the desired properties for the DM type machines. In the first stage, we introduce a new efficient heuristic clustering algorithm which reduces the communication time and balances the computational load. In the second stage, we devise a coloring algorithm which intends to minimize the synchronization overhead and coordinates the information exchange among processors. It is shown that the parallelization scheme effectively increases the speedups and the associated upper bound of G-S algorithm on the nCUBE2 machine.

AB - In our earlier papers, the parallelization and implementations of Gauss-Seidel(G-S) power flow analysis have been investigated on both shared memory (SM) and distributed memory (DM) machines. The desired properties to maximize the speedup, such as the minimum communication overhead and the balancing computational load, have been described. In this paper, we investigate a two stage parallelization scheme to achieve the desired properties for the DM type machines. In the first stage, we introduce a new efficient heuristic clustering algorithm which reduces the communication time and balances the computational load. In the second stage, we devise a coloring algorithm which intends to minimize the synchronization overhead and coordinates the information exchange among processors. It is shown that the parallelization scheme effectively increases the speedups and the associated upper bound of G-S algorithm on the nCUBE2 machine.

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

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

M3 - Conference contribution

AN - SCOPUS:0028089528

SN - 0818656026

SP - 497

EP - 501

BT - Proceedings of the International Conference on Parallel Processing

PB - Publ by IEEE

ER -