Skip to search formSkip to main contentSkip to account menu

Prefix sum

Known as: Prefix sums 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
Adder (electronics)All nearest smaller valuesArray data structureC++

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
K-Means for Parallel Architectures Using All-Prefix-Sum Sorting and Updating Steps
We present an implementation of parallel K-means clustering, called Kps-means, that achieves high performance with near-full… 
2013
2013
A Fast Implementation of Parallel Discrete-Event Simulation on GPGPU
Modern General Purpose Graphics Processing Units(GPGPUs) offer much more computational power than recent CPUs by providing a vast… 
2009
2009
Parallel SAH k-D Tree Construction for Fast Dynamic Scene Ray Tracing
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow… 
2009
2009
Cell-Probe Lower Bounds for Prefix Sums
  • Emanuele Viola
  • Electron. Colloquium Comput. Complex.
  • 2009
  • Corpus ID: 1038442
We prove that to store n bits x so that each prefix-sum query Sum(i) := sum_{k n + n/log^{O(q)} n. Our bound matches a recent… 
2008
2008
Probabilistic Analysis of Cellular Automata Rules and its Application in Pseudo Random Pattern Generation
The present work is an extension of the work that appeared in the article titled "Pseudoran- dom Pattern Generation by a 4… 
2006
2006
Spatio-temporal data warehouses using an adaptive cell-based approach
2002
2002
Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines
  • E. Santos
  • J. Parallel Distributed Comput.
  • 2002
  • Corpus ID: 206573679
The problem of designing efficient parallel algorithms for summing and prefix summing for certain classes of the LogP model is… 
Highly Cited
1998
Highly Cited
1998
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
  • Jie Wu
  • IEEE Trans. Parallel Distributed Syst.
  • 1998
  • Corpus ID: 12941596
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach… 
1997
1997
From algorithm parallelism to instruction-level parallelism: an encode-decode chain using prefix-sum
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum 
1995
1995
Prefix-Sums Algorithms on Reconfigurable Meshes
This paper shows that the prefix-sums of n binary values can be computed in $O (\log n /\sqrt{m\log m} +\log \log n)$ time on an… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)