Optimal and efficient algorithms for summing and prefix summing on parallel machines

DOI10.1006/JPDC.2000.1698zbMATH Open1015.68237DBLPjournals/jpdc/Santos02OpenAlexW2050555786WikidataQ60307045 ScholiaQ60307045MaRDI QIDQ697003FDOQ697003

Eunice E. Santos

Publication date: 12 September 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1698

Recommendations

• scientific article; zbMATH DE number 1304056
• Faster optimal parallel prefix sums and list ranking
• Efficient parallel prefix algorithms on multiport message-passing systems
• An Improved Parallel Prefix Sums Algorithm
• Optimal computation of prefix sums on a binary tree of processors

zbMATH Keywords

prefix summing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (4)

• Efficient parallel prefix algorithms on multiport message-passing systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Faster optimal parallel prefix sums and list ranking

This page was built for publication: Optimal and efficient algorithms for summing and prefix summing on parallel machines

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