Sciweavers

7 search results - page 1 / 2
» Unrolling Loops Containing Task Parallelism
Sort
View
LCPC
2009
Springer
13 years 9 months ago
Unrolling Loops Containing Task Parallelism
Classic loop unrolling allows to increase the performance of sequential loops by reducing the overheads of the non-computational parts of the loop. Unfortunately, when the loop con...
Roger Ferrer, Alejandro Duran, Xavier Martorell, E...
FPL
2008
Springer
109views Hardware» more  FPL 2008»
13 years 6 months ago
Loop unrolling and shifting for reconfigurable architectures
Loops are an important source of optimization. In this paper, we propose an extension to our work on loop unrolling and loop shifting for reconfigurable architectures. By applying...
Ozana Silvia Dragomir, Todor Stefanov, Koen Bertel...
MICRO
1995
IEEE
217views Hardware» more  MICRO 1995»
13 years 8 months ago
Improving instruction-level parallelism by loop unrolling and dynamic memory disambiguation
Exploitation ofinstruction-levelparallelism is an ejfective mechanism for improving the performance of modern super-scalar/VLIW processors. Various software techniques can be appl...
Jack W. Davidson, Sanjay Jinturkar
ARC
2008
Springer
112views Hardware» more  ARC 2008»
13 years 6 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 ...
ISHPC
2000
Springer
13 years 8 months ago
Limits of Task-Based Parallelism in Irregular Applications
Traditional parallel compilers do not effectively parallelize irregular applications because they contain little looplevel parallelism due to ambiguous memory references. We explo...
Barbara Kreaseck, Dean M. Tullsen, Brad Calder