DMCA
Geometric Algorithms for Private-Cache Chip Multiprocessors (Extended Abstract)
| Citations: | 5 - 3 self |
BibTeX
@MISC{Ajwani_geometricalgorithms,
author = {Deepak Ajwani and Norbert Zeh and Nodari Sitchinava},
title = {Geometric Algorithms for Private-Cache Chip Multiprocessors (Extended Abstract)},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors. We show how to obtain optimal algorithms for interval stabbing counting, 1-D range counting, weighted 2-D dominance counting, and for computing 3-D maxima, 2-D lower envelopes, and 2-D convex hulls. These results are obtained by analyzing adaptations of either the PEM merge sort algorithm or PRAM algorithms. For the second group of problems—orthogonal line segment intersection reporting, batched range reporting, and related problems—more effort is required. What distinguishes these problems from theones in theprevious group is the variable outputsize, which requires I/O-efficient load balancing strategies based on the contribution of the individual input elements to the output size. To obtain nearly optimal algorithms for these problems, we introduce a parallel distribution sweeping technique inspired by its sequential counterpart. 1
Keyphrases
private-cache chip multiprocessor geometric algorithm extended abstract optimal algorithm theprevious group geometric problem pem merge sort algorithm range reporting 2-d convex hull individual input element efficient algorithm pram algorithm variable outputsize second group parallel distribution 2-d dominance counting 3-d maximum sequential counterpart related problem output size 1-d range counting o-efficient load
