Efficient parallel computations on the reduced mesh of trees organization

Hussein Alnuweiri, V. K. Prasanna

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Optimal and near optimal parallel algorithms for several fundamental problems are proposed for a parallel organization consistmg of n processors, each having access to a row and a column of an n × n array of memory modules. Parallel computations are implemented on such an organization by decomposing them into alternating orthogonal processing phases. A number of efficient data movement techniques are developed for the proposed organization which lead to optimal or near optimal solutions to several communication-intensive problems such as sorting, performing permutations, list ranking (data dependent parallel prefix), and problems on graphs represented by an unsorted list of n2 edges. It is also shown that the proposed organization is capable of simulating any fixed-degree network on n2 processors with O(n) loss in time, which is optimal. Finally, an enhanced organization having p processors, 1 ≤ p ≤ n2, and O(n2) memory locations is presented, and is shown to provide optimal speedups for adjacency-matrix based graph problems for any number of processors in the range [1, n3/2].

Original languageEnglish
Pages (from-to)121-135
Number of pages15
JournalJournal of Parallel and Distributed Computing
Volume20
Issue number2
DOIs
Publication statusPublished - 1 Jan 1994
Externally publishedYes

Fingerprint

Trees (mathematics)
Parallel Computation
Mesh
Dependent Data
Prefix
Adjacency Matrix
Data storage equipment
Graph in graph theory
Optimal Algorithm
Sorting
Parallel Algorithms
Ranking
Permutation
Parallel algorithms
Optimal Solution
Module
Range of data
Communication
Processing

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Efficient parallel computations on the reduced mesh of trees organization. / Alnuweiri, Hussein; Prasanna, V. K.

In: Journal of Parallel and Distributed Computing, Vol. 20, No. 2, 01.01.1994, p. 121-135.

Research output: Contribution to journalArticle

@article{bfe77df397a24e9a8d6a634ba1654330,
title = "Efficient parallel computations on the reduced mesh of trees organization",
abstract = "Optimal and near optimal parallel algorithms for several fundamental problems are proposed for a parallel organization consistmg of n processors, each having access to a row and a column of an n × n array of memory modules. Parallel computations are implemented on such an organization by decomposing them into alternating orthogonal processing phases. A number of efficient data movement techniques are developed for the proposed organization which lead to optimal or near optimal solutions to several communication-intensive problems such as sorting, performing permutations, list ranking (data dependent parallel prefix), and problems on graphs represented by an unsorted list of n2 edges. It is also shown that the proposed organization is capable of simulating any fixed-degree network on n2 processors with O(n) loss in time, which is optimal. Finally, an enhanced organization having p processors, 1 ≤ p ≤ n2, and O(n2) memory locations is presented, and is shown to provide optimal speedups for adjacency-matrix based graph problems for any number of processors in the range [1, n3/2].",
author = "Hussein Alnuweiri and Prasanna, {V. K.}",
year = "1994",
month = "1",
day = "1",
doi = "10.1006/jpdc.1994.1013",
language = "English",
volume = "20",
pages = "121--135",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Efficient parallel computations on the reduced mesh of trees organization

AU - Alnuweiri, Hussein

AU - Prasanna, V. K.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Optimal and near optimal parallel algorithms for several fundamental problems are proposed for a parallel organization consistmg of n processors, each having access to a row and a column of an n × n array of memory modules. Parallel computations are implemented on such an organization by decomposing them into alternating orthogonal processing phases. A number of efficient data movement techniques are developed for the proposed organization which lead to optimal or near optimal solutions to several communication-intensive problems such as sorting, performing permutations, list ranking (data dependent parallel prefix), and problems on graphs represented by an unsorted list of n2 edges. It is also shown that the proposed organization is capable of simulating any fixed-degree network on n2 processors with O(n) loss in time, which is optimal. Finally, an enhanced organization having p processors, 1 ≤ p ≤ n2, and O(n2) memory locations is presented, and is shown to provide optimal speedups for adjacency-matrix based graph problems for any number of processors in the range [1, n3/2].

AB - Optimal and near optimal parallel algorithms for several fundamental problems are proposed for a parallel organization consistmg of n processors, each having access to a row and a column of an n × n array of memory modules. Parallel computations are implemented on such an organization by decomposing them into alternating orthogonal processing phases. A number of efficient data movement techniques are developed for the proposed organization which lead to optimal or near optimal solutions to several communication-intensive problems such as sorting, performing permutations, list ranking (data dependent parallel prefix), and problems on graphs represented by an unsorted list of n2 edges. It is also shown that the proposed organization is capable of simulating any fixed-degree network on n2 processors with O(n) loss in time, which is optimal. Finally, an enhanced organization having p processors, 1 ≤ p ≤ n2, and O(n2) memory locations is presented, and is shown to provide optimal speedups for adjacency-matrix based graph problems for any number of processors in the range [1, n3/2].

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

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

U2 - 10.1006/jpdc.1994.1013

DO - 10.1006/jpdc.1994.1013

M3 - Article

VL - 20

SP - 121

EP - 135

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 2

ER -