Description: Prefix sums are trivial to compute in sequential models of computation, by using the formula yi = yi − 1 + xi to compute each output value in sequence order. However, despite their ease of computation, prefix sums are a useful primitive in certain algorithms such as counting sort,[1] and they form the basis of the scan higher-order function in functional programming languages. Prefix sums have also been much studied in parallel algorithms, both as a test problem to be solved and as a useful primitive to be used as a subroutine in other parallel algorithms
To Search:
File list (Check if you may need any files):
prefix sum\Debug\prefix sum.exe
..........\.....\prefix sum.ilk
..........\.....\prefix sum.pdb
..........\prefix sum\Debug\CL.read.1.tlog
..........\..........\.....\CL.write.1.tlog
..........\..........\.....\link-cvtres.read.1.tlog
..........\..........\.....\link-cvtres.write.1.tlog
..........\..........\.....\link-rc.read.1.tlog
..........\..........\.....\link-rc.write.1.tlog
..........\..........\.....\link.read.1.tlog
..........\..........\.....\link.write.1.tlog
..........\..........\.....\prefix sum.lastbuildstate
..........\..........\.....\prefix sum.log
..........\..........\.....\prefix sum.obj
..........\..........\.....\vc110.idb
..........\..........\.....\vc110.pdb
..........\..........\prefix sum.cpp
..........\..........\prefix sum.vcxproj
..........\..........\prefix sum.vcxproj.filters
..........\prefix sum.sln
..........\prefix sum.v11.suo
..........\..........\Debug
..........\Debug
..........\prefix sum
prefix sum
Download