Papers › Efficient Parallelization of a Ubiquitous Sequential Computation
Efficient Parallelization of a Ubiquitous Sequential Computation
Franz A. Heinsen
We find a succinct expression for computing the sequence xₜ = aₜ xₜ₋₁ + bₜ in parallel with two prefix sums, given t = (1, 2, …, n), aₜ ∈ℝⁿ, bₜ ∈ℝⁿ, and initial value x₀ ∈ℝ. On n parallel processors, the computation of n elements incurs 𝒪(logn) time and 𝒪(n) space. Sequences of this form are ubiquitous in science and engineering, making efficient parallelization useful for a vast number of applications. We implement our expression in software, test it on parallel hardware, and verify that it executes faster than sequential computation by a factor of n/logn.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections