Sciweavers

272 search results - page 2 / 55
» Code Transformations to Improve Memory Parallelism
Sort
View
ASAP
2006
IEEE
110views Hardware» more  ASAP 2006»
13 years 11 months ago
Loop Transformation Methodologies for Array-Oriented Memory Management
Abstract – The storage requirements in data-dominant signal processing systems, whose behavior is described by arraybased, loop-organized algorithmic specifications, have an imp...
Florin Balasa, Per Gunnar Kjeldsberg, Martin Palko...
ASAP
2007
IEEE
135views Hardware» more  ASAP 2007»
13 years 7 months ago
An Efficient SIMD Architecture with Parallel Memory for 2D Cosine Transforms of Video Coding
Jianying Peng, Xing Qin, Dexian Li, Xiaolang Yan, ...
TPDS
1998
157views more  TPDS 1998»
13 years 5 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
PATMOS
2005
Springer
13 years 11 months ago
Improving the Memory Bandwidth Utilization Using Loop Transformations
Abstract. Embedded devices designed for various real-time multimedia and telecom applications, have a bottleneck in energy consumption and performance that becomes day by day more ...
Minas Dasygenis, Erik Brockmeyer, Francky Catthoor...
PLDI
1994
ACM
13 years 9 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar