Code-Size Conscious Pipelining of Imperfectly Nested Loops - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Code-Size Conscious Pipelining of Imperfectly Nested Loops

Abstract

This paper is a step towards enabling multidimensional software pipelining of non-perfectly nested loops on memory-constrained architectures.We propose a method to pipeline multiple inner loops without increasing the size of the loop nest, apart from an outermost prolog and epilog. We focus on the domain of media and signal processing, where short inner loops are common and where embedded constraints drive the selection of code-size conscious algorithms. Our first results indicate that the additional constraints associated with the method do not impede the extraction of significant amounts of instruction-level parallelism. In addition to preserving precious scratch-pad or cache memory, our method also avoids the performance overhead of prologs and epilogs resulting from pipelined inner loops with short trip count.
Fichier principal
Vignette du fichier
Code-Size.pdf (142.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00646688 , version 1 (30-11-2011)

Identifiers

Cite

Mohammed Fellahi, Albert Cohen, Sid Touati. Code-Size Conscious Pipelining of Imperfectly Nested Loops. MEDEA Workshop (MEmory performance DEaling with Applications, systems and architecture), held in conjunction with PACT 2007 Conference, Sep 2007, Brasov, Romania. ⟨10.1145/1327171.1327177⟩. ⟨hal-00646688⟩
333 View
172 Download

Altmetric

Share

Gmail Facebook X LinkedIn More