Summing up function values in parallel: A complexity analysis

DOI10.1016/0893-9659(93)90149-HzbMATH Open0796.68111MaRDI QIDQ2365993FDOQ2365993

Authors: Andrej Broido 

Publication date: 29 June 1993

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

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

zbMATH Keywords

optimal schedule

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing Sequences with Addition Chains
• Some Computer Organizations and Their Effectiveness

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)