summaryrefslogtreecommitdiff
path: root/winaccessibility/source
diff options
context:
space:
mode:
authorDennis Francis <dennis.francis@collabora.com>2019-07-09 23:07:23 +0530
committerDennis Francis <dennis.francis@collabora.com>2019-10-01 18:11:36 +0200
commit46d0afba738d8ee7c9b63384fef513f42ee587f3 (patch)
treebc4f6927f56974f6fc3cdb6224437e01a01e372c /winaccessibility/source
parent845e1cdca3349c72e3083186502285d5b776abbe (diff)
Implement parallel version of super-scalar-sample-sort...
and use it for the pivot table construction routine processBuckets(). The implementation uses ideas from the non-parallel sample sort discussed in the below paper, but parallelizes the "binning"/"classification" operations and the sorting of the bins themselves. Sanders, Peter, and Sebastian Winkel. "Super scalar sample sort." European Symposium on Algorithms. Springer, Berlin, Heidelberg, 2004. which can be accessed at : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.72.366&rep=rep1&type=pdf Change-Id: I3723b87e2feb8d7d9ee03f71f6025e26add914ce Reviewed-on: https://gerrit.libreoffice.org/79486 Tested-by: Jenkins Reviewed-by: Luboš Luňák <l.lunak@collabora.com>
Diffstat (limited to 'winaccessibility/source')
0 files changed, 0 insertions, 0 deletions