Faster optimal parallel prefix sums and list ranking

Richard Cole, Uzi Vishkin

Research output: Contribution to journalArticle

Abstract

We present a parallel algorithm for the prefix sums problem which runs in time O( log n log log n) using n log log n log n processors (optimal speedup). This algorithm leads to a parallel list ranking algorithm which runs in O(log n) time using n log n processors (optimal speedup).

Original languageEnglish (US)
Pages (from-to)334-352
Number of pages19
JournalInformation and Computation
Volume81
Issue number3
DOIs
StatePublished - 1989

Fingerprint

Prefix
Ranking
Speedup
Parallel algorithms
Parallel Algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Faster optimal parallel prefix sums and list ranking. / Cole, Richard; Vishkin, Uzi.

In: Information and Computation, Vol. 81, No. 3, 1989, p. 334-352.

Research output: Contribution to journalArticle

Cole, Richard ; Vishkin, Uzi. / Faster optimal parallel prefix sums and list ranking. In: Information and Computation. 1989 ; Vol. 81, No. 3. pp. 334-352.
@article{4c34febb0a66409c8c7877404792c105,
title = "Faster optimal parallel prefix sums and list ranking",
abstract = "We present a parallel algorithm for the prefix sums problem which runs in time O( log n log log n) using n log log n log n processors (optimal speedup). This algorithm leads to a parallel list ranking algorithm which runs in O(log n) time using n log n processors (optimal speedup).",
author = "Richard Cole and Uzi Vishkin",
year = "1989",
doi = "10.1016/0890-5401(89)90036-9",
language = "English (US)",
volume = "81",
pages = "334--352",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "3",

}

TY - JOUR

T1 - Faster optimal parallel prefix sums and list ranking

AU - Cole, Richard

AU - Vishkin, Uzi

PY - 1989

Y1 - 1989

N2 - We present a parallel algorithm for the prefix sums problem which runs in time O( log n log log n) using n log log n log n processors (optimal speedup). This algorithm leads to a parallel list ranking algorithm which runs in O(log n) time using n log n processors (optimal speedup).

AB - We present a parallel algorithm for the prefix sums problem which runs in time O( log n log log n) using n log log n log n processors (optimal speedup). This algorithm leads to a parallel list ranking algorithm which runs in O(log n) time using n log n processors (optimal speedup).

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

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

U2 - 10.1016/0890-5401(89)90036-9

DO - 10.1016/0890-5401(89)90036-9

M3 - Article

AN - SCOPUS:0024684158

VL - 81

SP - 334

EP - 352

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 3

ER -