Summing up function values in parallel: A complexity analysis

DOI10.1016/0893-9659(93)90149-HMaRDI QIDQ2365993zbMATH OpenFDO

Authors Andrej Broido

Publication date 29 June 1993

Published in Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

optimal schedule

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Optimal computation of prefix sums on a binary tree of processors
• A Simple Parallel Algorithm for Polynomial Evaluation
• The strict time lower bound and optimal schedules for parallel prefix with resource constraints
• The parallel complexity of integer prefix summation

Cites work

• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3191380 (Why is no real title available?)
• Computing Sequences with Addition Chains
• Some Computer Organizations and Their Effectiveness

Cited in

(3)

• scientific article; zbMATH DE number 809141 (Why is no real title available?)
• scientific article; zbMATH DE number 3858283 (Why is no real title available?)
• scientific article; zbMATH DE number 6479070 (Why is no real title available?)

This page was built for publication: Summing up function values in parallel: A complexity analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365993)