Load-Store Optimization For Software Pipelining - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Architecture News Year : 2000

Load-Store Optimization For Software Pipelining


Software pipelining can generate efficient schedules for loop by overlapping the execution of operations from different iterations in order to exploit maximum Instruction Level Parallelism (ILP). Code optimization can decrease total number of calculations and memory related operations. As a result, instruction schedules can use freed resources to construct shorter schedules. Particularly, when the data is not presented in cache, the performance will be significantly degraded by memory references. Therefore, elimination of redundant load-store operations is most important for improving overall performance. This paper introduces a method for integrating software pipelining and load-store elimination techniques. Moreover, we demonstrate that integrated algorithm is more effective than other methods.
Fichier principal
Vignette du fichier
Load-Store-2.pdf (291.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00647085 , version 1 (01-12-2011)



Min Dai, Christine Eisenbeis, Sid Touati. Load-Store Optimization For Software Pipelining. Computer Architecture News, 2000, 28 (1), pp.3 - 10. ⟨10.1145/346023.346027⟩. ⟨hal-00647085⟩
447 View
95 Download



Gmail Facebook Twitter LinkedIn More