Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,670,161 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Adder (electronics)
All nearest smaller values
Array data structure
C++
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort
Michael Axtmann
,
Armin Wiebigke
,
P. Sanders
arXiv.org
2017
Corpus ID: 195346365
MPI uses the concept of communicators to connect groups of processes. It provides nonblocking collective operations on…
Expand
2013
2013
A Fast Implementation of Parallel Discrete-Event Simulation on GPGPU
Janche Sang
,
Che-Rung Lee
,
V. Rego
,
C. King
2013
Corpus ID: 9757910
Modern General Purpose Graphics Processing Units(GPGPUs) offer much more computational power than recent CPUs by providing a vast…
Expand
2011
2011
Solutions For Optimizing The Data Parallel Prefix Sum Algorithm Using The Compute Unified Device Architecture
Ion Lungu
,
D. Petroșanu
,
Alexandru Pîrjan
2011
Corpus ID: 14465719
In this paper, we analyze solutions for optimizing the data parallel prefix sum function using the Compute Unified Device…
Expand
2009
2009
Parallel SAH k-D Tree Construction for Fast Dynamic Scene Ray Tracing
A. Hart
2009
Corpus ID: 14487615
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…
Expand
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…
Expand
2008
2008
Probabilistic Analysis of Cellular Automata Rules and its Application in Pseudo Random Pattern Generation
A. Seth
,
S. Bandyopadhyay
,
U. Maulik
2008
Corpus ID: 10559948
The present work is an extension of the work that appeared in the article titled "Pseudoran- dom Pattern Generation by a 4…
Expand
2005
2005
On the Optimality of the Greedy Heuristic in Wavelet Synopses for Range Queries
Yossi Matias
,
Daniel Urieli
2005
Corpus ID: 9627607
In recent years wavelet based synopses were shown to be efiective for approximate queries in database systems. The simplest…
Expand
2003
2003
An Efficient Parallel Prefix Sums Architecture with Domino Logic
R. Lin
,
K. Nakano
,
S. Olariu
,
Albert Y. Zomaya
IEEE Trans. Parallel Distributed Syst.
2003
Corpus ID: 32433278
The main contribution of this work is to propose an efficient parallel prefix sums architecture based on the recently-developed…
Expand
2003
2003
Partial Prefix Sum Method for Large Data Warehouses
Seok-Ju Chun
International Syposium on Methodologies for…
2003
Corpus ID: 9868318
A range-sum query computes aggregate information over a data cube in the query range specified by a user. Existing methods based…
Expand
1997
1997
From algorithm parallelism to instruction-level parallelism: an encode-decode chain using prefix-sum
U. Vishkin
ACM Symposium on Parallelism in Algorithms and…
1997
Corpus ID: 15796449
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum