Sciweavers

272 search results - page 16 / 55
» Code Transformations to Improve Memory Parallelism
Sort
View
IEEEPACT
1998
IEEE
14 years 25 days ago
Data Dependence Analysis of Assembly Code
Determination of data dependences is a task typically performed with high-level language source code in today's optimizing and parallelizing compilers. Very little work has b...
Wolfram Amme, Peter Braun, Eberhard Zehendner, Fra...
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
14 years 3 months ago
A memory optimization technique for software-managed scratchpad memory in GPUs
—With the appearance of massively parallel and inexpensive platforms such as the G80 generation of NVIDIA GPUs, more real-life applications will be designed or ported to these pl...
Maryam Moazeni, Alex A. T. Bui, Majid Sarrafzadeh
ICASSP
2011
IEEE
13 years 1 days ago
Low-complexity predictive lossy compression of hyperspectral and ultraspectral images
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
Andrea Abrardo, Mauro Barni, Enrico Magli
ICS
2009
Tsinghua U.
14 years 3 months ago
MPI-aware compiler optimizations for improving communication-computation overlap
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
Anthony Danalis, Lori L. Pollock, D. Martin Swany,...
WOMPAT
2001
Springer
14 years 1 months ago
A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
Dimitrios S. Nikolopoulos, Eduard Ayguadé