Sciweavers

21 search results - page 1 / 5
» Optimal loop unrolling for GPGPU programs
Sort
View
IPPS
2010
IEEE
13 years 2 months ago
Optimal loop unrolling for GPGPU programs
Giridhar Sreenivasa Murthy, Mahesh Ravishankar, Mu...
ISPAN
1997
IEEE
13 years 9 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
ARC
2008
Springer
112views Hardware» more  ARC 2008»
13 years 7 months ago
Optimal Unroll Factor for Reconfigurable Architectures
Abstract. Loops are an important source of optimization. In this paper, we address such optimizations for those cases when loops contain kernels mapped on reconfigurable fabric. We...
Ozana Silvia Dragomir, Elena Moscu Panainte, Koen ...
PLDI
2010
ACM
13 years 10 months ago
A GPGPU compiler for memory optimization and parallelism management
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
Yi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou
LCPC
1998
Springer
13 years 9 months ago
Copy Elimination for Parallelizing Compilers
Techniques for aggressive optimization and parallelization of applications can have the side-effect of introducing copy instructions, register-to-register move instructions, into t...
David J. Kolson, Alexandru Nicolau, Nikil D. Dutt