Skip to Main content Skip to Navigation
Journal articles

Load-Store Optimization For Software Pipelining

Min Dai 1 Christine Eisenbeis 1 Sid Touati 1 
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Sid Touati Connect in order to contact the contributor
Submitted on : Thursday, December 1, 2011 - 2:35:06 PM
Last modification on : Sunday, June 26, 2022 - 11:54:57 AM
Long-term archiving on: : Friday, March 2, 2012 - 2:32:02 AM


Files produced by the author(s)




Min Dai, Christine Eisenbeis, Sid Touati. Load-Store Optimization For Software Pipelining. Computer Architecture News, Institute of Electrical and Electronics Engineers, 2000, 28 (1), pp.3 - 10. ⟨10.1145/346023.346027⟩. ⟨hal-00647085⟩



Record views


Files downloads