Document - Practical trade-offs for the prefix-sum problem

2020

Journal article Open Access

Practical trade-offs for the prefix-sum problem

Pibiri Ge, Venturini R

efficiency performance evaluation prefix-sum SIMD

Given an integer arrayA, theprefix-sum problemis to answersum(i)queries that return the sum of the elements inA[0..i], knowing that the integers inAcan be changed. It is a classic problem in data structure design with a wide range of applications in computing from coding to databases. In this work, we propose and compare practical solutions to this problem, showing that new trade-offs between the performance of queries and updates can be achieved on modern hardware.

Source: SOFTWARE-PRACTICE & EXPERIENCE

Back to previous page

Cite as

BibTeX entry

@article{oai:it.cnr:prodotti:435491,
	title = {Practical trade-offs for the prefix-sum problem},
	author = {Pibiri Ge and Venturini R},
	year = {2020}
}