Sciweavers

6939 search results - page 80 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
SPAA
1992
ACM
14 years 4 days ago
Separator Based Parallel Divide and Conquer in Computational Geometry
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
POPL
2008
ACM
14 years 8 months ago
Much ado about two (pearl): a pearl on parallel prefix computation
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
Janis Voigtländer
DIGRA
2005
Springer
14 years 1 months ago
Game Engineering for a Multiprocessor Architecture
This paper explores the idea that future game consoles and computers may no longer be single processor units, but instead symmetrical multiprocessor units. If this were to occur g...
Abdennour El Rhalibi, Steve Costa, David England
DEBS
2010
ACM
13 years 12 months ago
Evaluation of streaming aggregation on parallel hardware architectures
We present a case study parallelizing streaming aggregation on three different parallel hardware architectures. Aggregation is a performance-critical operation for data summarizat...
Scott Schneider, Henrique Andrade, Bugra Gedik, Ku...
IPPS
2005
IEEE
14 years 1 months ago
Improving and Stabilizing Parallel Computer Performance Using Adaptive Backfilling
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...
David Talby, Dror G. Feitelson