Sciweavers

110 search results - page 16 / 22
» Data-Parallel R-Tree Algorithms
Sort
View
ACSC
2008
IEEE
14 years 4 months ago
Reasoning about inherent parallelism in modern object-oriented languages
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
Wayne Reid, Wayne Kelly, Andrew Craik
HPCN
1995
Springer
14 years 1 months ago
Exploiting high performance Fortran for computational fluid dynamics
Abstract. We discuss the High Performance Fortran data parallel programming language as an aid to software engineering and as a tool for exploiting High Performance Computing syste...
Kenneth A. Hawick, Geoffrey Fox
HPDC
2008
IEEE
14 years 4 months ago
Scheduling mixed-parallel applications with advance reservations
This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizi...
Kento Aida, Henri Casanova
IPPS
1996
IEEE
14 years 2 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
JPDC
2008
135views more  JPDC 2008»
13 years 9 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson