Live briefing
Everything about Prefix sum
Sequence in computer science
In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers x0, x1, x2, ... is a second sequence of numbers y0, y1, y2, ..., the sums of prefixes of the input sequence:y0 = x0 y1 = x0 + x1 y2 = x0 + x1+ x2 ... Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Prefix sumA 5-minute orientation
- Skim a recent paper: An Improved Parallel Prefix Sums AlgorithmInfluential work since 2022
- Pick up a classic book: Book of common prayerThe most-reprinted book on the subject
- Read the landmark paper: K-Means for Parallel Architectures Using All-Prefix-Sum Sorting and Updating StepsCited 24 times
- Go sideways: Two-tree broadcastA closely related topic
- Go sideways: Hypercube (communication pattern)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
K-Means for Parallel Architectures Using All-Prefix-Sum Sorting and Updating Steps
Formal verification of parallel prefix sum and stream compaction algorithms in CUDA
Parallel Dynamics Computation Using Prefix Sum Operations
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
Practical trade‐offs for the prefix‐sum problem
Almost optimal column-wise prefix-sum computation on the GPU
Sum Rate Maximization With Shortened Cyclic Prefix in a MIMO-OFDM System
A compression method for prefix-sum cubes
🆕 Influential since 2022
An Improved Parallel Prefix Sums Algorithm
Elementary Algorithms – Prefix Sum
A Low‐Complexity Target Detection Technique Using the Prefix Sum Algorithm
Prefix-sum encoding for quantum annealing with application to haplotype inference
Design an energy efficient ternary parallel prefix carry/sum propagate adders using 32-nm CNTFET
📚 Books worth reading
Book of common prayerChurch of England, J. A. Maurault · 1537
Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
A papist misrepresented and representedJohn Gother · 1685
Direct current fundamentalsOrla E. Loper, Edgar Tedsen · 1959
Campbell biologyLisa A. Urry, Michael L. Cain · 2015
Programming Massively Parallel ProcessorsDavid Kirk, Wen-Mei W. Hwu · 2010
Computer algorithmsEllis Horowitz · 1997
Faster optimal parallel prefix sums and list rankingRichard Cole · 1987
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Two-tree broadcast The two-tree broadcast (abbreviated 2tree-broadcast or 23-broadcast) is an algorithm that implements a broadcast communication pattern on a distributed…
- Hypercube (communication pattern) d-dimensional hypercube is a network topology for parallel computers with 2d processing elements. The topology allows for an efficient implementation of…
- Fenwick tree A Fenwick tree or binary indexed tree (BIT) is a data structure that stores an array of values and can efficiently compute prefix sums of the values and…
- Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
- Tree contraction In computer science, parallel tree contraction is a broadly applicable technique for the parallel solution of a large number of tree problems, and is used…
- Parallel external memory In computer science, a parallel external memory (PEM) model is a cache-aware, external-memory abstract machine. It is the parallel-computing analogy to…
- Optimal binary search tree In computer science, an optimal binary search tree, or optimal BST, sometimes called a weight-balanced binary tree, is a binary search tree which provides…
- Data parallelism Data parallelism is parallelization across multiple processors in parallel computing environments. It focuses on distributing the data across different…