An algorithm for parallel evaluation of functions

Eliezer L. Lozinskii

doi:10.1016/0196-6774(83)90026-3

An algorithm for parallel evaluation of functions

Eliezer L. Lozinskii^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

Abstract

A technique is shown for speeding up parallel evaluation of functions. An algorithm is presented that evaluates powers xⁿ in time O(√log n) using O(n) processors and certain preprocessed data, while the known algorithms take [log₂ n] steps of multiplication or addition.

Original language	English
Pages (from-to)	271-281
Number of pages	11
Journal	Journal of Algorithms
Volume	4
Issue number	3
DOIs	https://doi.org/10.1016/0196-6774(83)90026-3
State	Published - Sep 1983

Access to Document

10.1016/0196-6774(83)90026-3

Cite this

@article{495e734c16f44a7cae200e9b104e847c,

title = "An algorithm for parallel evaluation of functions",

abstract = "A technique is shown for speeding up parallel evaluation of functions. An algorithm is presented that evaluates powers xn in time O(√log n) using O(n) processors and certain preprocessed data, while the known algorithms take [log2 n] steps of multiplication or addition.",

author = "Lozinskii, \{Eliezer L.\}",

year = "1983",

month = sep,

doi = "10.1016/0196-6774(83)90026-3",

language = "אנגלית",

volume = "4",

pages = "271--281",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "3",

}

TY - JOUR

T1 - An algorithm for parallel evaluation of functions

AU - Lozinskii, Eliezer L.

PY - 1983/9

Y1 - 1983/9

N2 - A technique is shown for speeding up parallel evaluation of functions. An algorithm is presented that evaluates powers xn in time O(√log n) using O(n) processors and certain preprocessed data, while the known algorithms take [log2 n] steps of multiplication or addition.

AB - A technique is shown for speeding up parallel evaluation of functions. An algorithm is presented that evaluates powers xn in time O(√log n) using O(n) processors and certain preprocessed data, while the known algorithms take [log2 n] steps of multiplication or addition.

UR - https://www.scopus.com/pages/publications/48749145644

U2 - 10.1016/0196-6774(83)90026-3

DO - 10.1016/0196-6774(83)90026-3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:48749145644

SN - 0196-6774

VL - 4

SP - 271

EP - 281

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 3

ER -

An algorithm for parallel evaluation of functions

Abstract

Access to Document

Other files and links

Fingerprint

Cite this