An Improved Parallel Prefix Sums Algorithm
From MaRDI portal
Publication:6135727
DOI10.1142/S0129626422500086zbMATH Open1518.68420OpenAlexW4296598180MaRDI QIDQ6135727FDOQ6135727
Authors: Hazem M. Bahig, Khaled A. Fathy 
Publication date: 26 August 2023
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626422500086
Recommendations
- Faster optimal parallel prefix sums and list ranking
- scientific article; zbMATH DE number 1304056
- The parallel complexity of integer prefix summation
- Parallel general prefix computations with geometric, algebraic, and other applications
- Optimal computation of prefix sums on a binary tree of processors
Cites Work
Cited In (10)
- Fast parallel algorithm for prefix computation in multi-mesh architecture
- Title not available (Why is that?)
- Optimal and efficient algorithms for summing and prefix summing on parallel machines
- Construction of algorithms for parallel addition in expanding bases via extending window method
- Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system
- Title not available (Why is that?)
- Faster optimal parallel prefix sums and list ranking
- Parallel general prefix computations with geometric, algebraic, and other applications
- Optimal computation of prefix sums on a binary tree of processors
- Prefix computations on symmetric multiprocessors
This page was built for publication: An Improved Parallel Prefix Sums Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135727)
