Partial sum problem mapping into a hypercube

Hyoung Joong Kim; Jang Gyu Lee

doi:10.1016/0020-0190(90)90145-N

Partial sum problem mapping into a hypercube

Hyoung Joong Kim, Jang Gyu Lee

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

A systematic hypercube mapping method for partial sum problem is considered. For the mapping, a unique reflected Gray code is utilized. The mapping provides a reduced number of interprocess communication. A routing algorithm for the regular communication is presented. It keeps the nodes to be contention-free and fully utilized.

Original language	English
Pages (from-to)	221-224
Number of pages	4
Journal	Information Processing Letters
Volume	36
Issue number	5
DOIs	https://doi.org/10.1016/0020-0190(90)90145-N
Publication status	Published - 1990 Dec 1
Externally published	Yes

Keywords

Gray code
hypercube
parallel computing
partial sum

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/0020-0190(90)90145-N

Cite this

@article{87e67777736c4dd4be94ccbc89369ab8,

title = "Partial sum problem mapping into a hypercube",

abstract = "A systematic hypercube mapping method for partial sum problem is considered. For the mapping, a unique reflected Gray code is utilized. The mapping provides a reduced number of interprocess communication. A routing algorithm for the regular communication is presented. It keeps the nodes to be contention-free and fully utilized.",

keywords = "Gray code, hypercube, parallel computing, partial sum",

author = "Kim, {Hyoung Joong} and Lee, {Jang Gyu}",

year = "1990",

month = dec,

day = "1",

doi = "10.1016/0020-0190(90)90145-N",

language = "English",

volume = "36",

pages = "221--224",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Partial sum problem mapping into a hypercube

AU - Kim, Hyoung Joong

AU - Lee, Jang Gyu

PY - 1990/12/1

Y1 - 1990/12/1

N2 - A systematic hypercube mapping method for partial sum problem is considered. For the mapping, a unique reflected Gray code is utilized. The mapping provides a reduced number of interprocess communication. A routing algorithm for the regular communication is presented. It keeps the nodes to be contention-free and fully utilized.

AB - A systematic hypercube mapping method for partial sum problem is considered. For the mapping, a unique reflected Gray code is utilized. The mapping provides a reduced number of interprocess communication. A routing algorithm for the regular communication is presented. It keeps the nodes to be contention-free and fully utilized.

KW - Gray code

KW - hypercube

KW - parallel computing

KW - partial sum

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

U2 - 10.1016/0020-0190(90)90145-N

DO - 10.1016/0020-0190(90)90145-N

M3 - Article

AN - SCOPUS:0025658649

SN - 0020-0190

VL - 36

SP - 221

EP - 224

JO - Information Processing Letters

JF - Information Processing Letters

IS - 5

ER -

Partial sum problem mapping into a hypercube

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this