Sciweavers

363 search results - page 37 / 73
» Optimizing Memory Accesses For Spatial Computation
Sort
View
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
14 years 1 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
SI3D
2010
ACM
14 years 2 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...
VIIP
2001
13 years 9 months ago
Using Graphics Cards for Quantized FEM Computations
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...
Martin Rumpf, Robert Strzodka
IEEEPACT
2009
IEEE
13 years 5 months ago
Region Based Structure Layout Optimization by Selective Data Copying
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
Sandya S. Mannarswamy, Ramaswamy Govindarajan, Ris...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 2 months ago
Energy Maps for Large-scale, Mobile Wireless Networks
— Energy planning and optimization constitutes one of the most significant challenges for high-mobility networks. This paper proposes a novel framework to share, retain and re...
Min Kyoung Park, Volkan Rodoplu