Building heaps in parallel

Nageswara S.V. Rao; Weixiong Zhang

doi:10.1016/0020-0190(91)90154-A

Building heaps in parallel

Nageswara S.V. Rao, Weixiong Zhang

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

20 Scopus citations

Abstract

We present O(log n) time parallel algorithms for constructing a heap of a set of n elements, chosen from a total order, using EREW PRAM and hypercube of at most [2n/log n] processors.

Original language	English
Pages (from-to)	355-358
Number of pages	4
Journal	Information Processing Letters
Volume	37
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(91)90154-A
State	Published - Mar 28 1991
Externally published	Yes

Keywords

Design of algorithms
EREW PRAM
heaps
hypercubes
parallel algorithms

Access to Document

10.1016/0020-0190(91)90154-A

Cite this

@article{2a1aef4a0645483181bcdf7616714f79,

title = "Building heaps in parallel",

abstract = "We present O(log n) time parallel algorithms for constructing a heap of a set of n elements, chosen from a total order, using EREW PRAM and hypercube of at most [2n/log n] processors.",

keywords = "Design of algorithms, EREW PRAM, heaps, hypercubes, parallel algorithms",

author = "Rao, {Nageswara S.V.} and Weixiong Zhang",

year = "1991",

month = mar,

day = "28",

doi = "10.1016/0020-0190(91)90154-A",

language = "English",

volume = "37",

pages = "355--358",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Building heaps in parallel

AU - Rao, Nageswara S.V.

AU - Zhang, Weixiong

PY - 1991/3/28

Y1 - 1991/3/28

N2 - We present O(log n) time parallel algorithms for constructing a heap of a set of n elements, chosen from a total order, using EREW PRAM and hypercube of at most [2n/log n] processors.

AB - We present O(log n) time parallel algorithms for constructing a heap of a set of n elements, chosen from a total order, using EREW PRAM and hypercube of at most [2n/log n] processors.

KW - Design of algorithms

KW - EREW PRAM

KW - heaps

KW - hypercubes

KW - parallel algorithms

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

U2 - 10.1016/0020-0190(91)90154-A

DO - 10.1016/0020-0190(91)90154-A

M3 - Article

AN - SCOPUS:0026121356

SN - 0020-0190

VL - 37

SP - 355

EP - 358

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

Building heaps in parallel

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this