Mallach, Sven ORCID: 0000-0001-5335-0678 and Castañeda, Roberto (2014). Optimal general offset assignment. In: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems - SCOPES '14, pp. 50-59. ACM.
Full text not available from this repository.Abstract
We present an exact approach to the General Offset Assign- ment problem arising in the domain of address code gen- eration for application specific and digital signal processors. General Offset Assignment is composed of two subproblems, namely to find a permutation of variables in memory and to select a responsible address register for each access to one of these variables. Our method is a combination of established techniques to solve both subproblems using integer linear programming. To the best of our knowledge, it is the first approach capable of solving almost all instances of the established OffsetStone benchmark set to global optimality within reasonable time. We provide a first comprehensive evaluation of the quality of several state-of-the-art heuristics relative to the optimal solutions.
Item Type: | Book Section, Proceedings Item or annotation in a legal commentary | ||||||||||||
Creators: |
|
||||||||||||
URN: | urn:nbn:de:hbz:38-640791 | ||||||||||||
DOI: | 10.1145/2609248.2609251 | ||||||||||||
Title of Book: | Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems - SCOPES '14 | ||||||||||||
Page Range: | pp. 50-59 | ||||||||||||
Date: | 2014 | ||||||||||||
Publisher: | ACM | ||||||||||||
Language: | English | ||||||||||||
Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||||||
Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||||||
Subjects: | Data processing Computer science | ||||||||||||
Refereed: | Yes | ||||||||||||
URI: | http://kups.ub.uni-koeln.de/id/eprint/64079 |
Downloads
Downloads per month over past year
Altmetric
Export
Actions (login required)
View Item |