Proceedings ArticleDOI
Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Neeraj Sharma,Sandeep Sen +1 more
- pp 74-76
TLDR
In this paper, a cache-oblivious framework for randomized divide and conquer algorithms on the multicore model with private cache is presented, where the number of processors, the size of an individual cache memory and the block size are assumed to be fixed.Abstract:
In this paper we present a cache-oblivious framework for randomized divide and conquer algorithms on the multicore model with private cache. We first derive an O(n/p log n + log n log log n) expected parallel depth algorithm for sorting n numbers with expected O(n/B logM n) cache misses where p,M and B respectively denote the number of processors, the size of an individual cache memory and the block size respectively. Although similar results have been obtained recently for sorting, we feel that our approach is simpler and general and we apply it to obtain an algorithm for 3D convex hulls with similar bounds.We also present a simple randomized processor allocation technique without the explicit knowledge of the number of processors that is likely to find additional applications in resource oblivious environments.read more
Citations
More filters
Journal ArticleDOI
Cache-Oblivious Parallel Convex Hull in the Binary Forking Model
TL;DR: In this article , the authors present two cache-oblivious sorting-based convex hull algorithms in the Binary Forking Model, one achieves O(n)$ work, O(log n)$ span, and O (n/B)$ serial cache complexity, where B is the cache line size.
References
More filters
Journal ArticleDOI
Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems
John H. Reif,Sandeep Sen +1 more
TL;DR: This paper presents an optimal parallel randomized algorithm for computing intersection of half spaces in three dimensions that is randomized in the sense that they use a total of only polylogarithmic number of random bits and terminate in the claimed time bound with probability of 1 - n - \alpha for any fixed $\alpha > 0$.
Book ChapterDOI
Resource oblivious sorting on multicores
Richard Cole,Vijaya Ramachandran +1 more
TL;DR: A new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging with an optimal number of cache misses is presented, which improves on previous bounds for deterministic sample sort.
Posted Content
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Neeraj Sharma,Sandeep Sen +1 more
TL;DR: A cache-oblivious framework for randomized divide and conquer algorithms on the multicore model with private cache and a simple randomized processor allocation technique without the explicit knowledge of the number of processors that is likely to find additional applications in resource oblivious environments are presented.