Resource Oblivious Sorting on Multicores

We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems all come from computational geometry, and are: orthogonal line segment intersection reporting, the all nearest neighbors problem, the 3D maxima problem, computing the measure of a set of axis-parallel rectangles, computing the visibility of a set of line segments from a point, batched orthogonal range queries, and reporting pairwise intersections of axis-parallel rectangles. Our basic building block is a simplified version of the cache oblivious sorting algorithm Funnelsort of Frigo et al., which is of independent interest. Full text: http://dx.doi.org/10.1007/3-540-45465-9_37

Randomized Shellsort: A Simple Oblivious Sorting Algorithm

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973075.101 ◽

2010 ◽

Cited By ~ 18

Author(s):

Michael T. Goodrich

Keyword(s):

Sorting Algorithm ◽

Oblivious Sorting

A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation

Secure IT Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11599-3_4 ◽

2014 ◽

pp. 59-74 ◽

Cited By ~ 8

Author(s):

Dan Bogdanov ◽

Sven Laur ◽

Riivo Talviste

Keyword(s):

Sorting Algorithms ◽

Practical Analysis ◽

Oblivious Sorting

Cache-Oblivious Sorting

Encyclopedia of Algorithms ◽

10.1007/978-1-4939-2864-4_63 ◽

2016 ◽

pp. 269-273

Author(s):

Gerth Stølting

Keyword(s):

Oblivious Sorting ◽

Cache Oblivious

Engineering a cache-oblivious sorting algorithm

Journal of Experimental Algorithmics ◽

10.1145/1227161.1227164 ◽

2008 ◽

Vol 12 ◽

pp. 1-23 ◽

Cited By ~ 10

Author(s):

Gerth Stølting Brodal ◽

Rolf Fagerberg ◽

Kristoffer Vinther

Keyword(s):

Sorting Algorithm ◽

Oblivious Sorting ◽

Cache Oblivious

Cache-Oblivious and Data-Oblivious Sorting and Applications

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975031.143 ◽

2018 ◽

pp. 2201-2220 ◽

Cited By ~ 3

Author(s):

T-H. Hubert Chan ◽

Yue Guo ◽

Wei-Kai Lin ◽

Elaine Shi

Keyword(s):

Oblivious Sorting ◽

Cache Oblivious

SAT and CP - Parallelisation and Applications

10.21941/kcss/2017/03 ◽

2017 ◽

Author(s):

Thorsten Ehlers

Keyword(s):

Parallel Implementation ◽

Lower And Upper Bounds ◽

Sat Solving ◽

Learning Mechanisms ◽

Sorting Networks ◽

Parallel Solver ◽

Sorting Algorithms ◽

Programming Techniques ◽

Oblivious Sorting

In this thesis, we consider the parallelisation and application of SAT and CP solvers. In the first chapter, we consider SAT, the decision problem of propositional logic. We discuss details of the implementations of SAT solvers, and show how to improve upon existing sequential solvers. Furthermore, we discuss the parallelisation of these solvers with a focus on the communication of intermediate results within a parallel solver. The second chapter is concerned with Contraint Programing (CP) with learning. Contrary to classical Constraint Programming techniques, this incorporates learning mechanisms as they are used in the field of SAT solving. We present results from parallelising CHUFFED, a learning CP solver. In the final chapter, we discuss Sorting Networks, which are data oblivious sorting algorithms. Their independence of the input data lends them to parallel implementation. We consider the question how many parallel sorting steps are needed to sort some inputs, and present both lower and upper bounds for several cases.