Optimal general offset assignment

Mallach, Sven and Lozano, Roberto CastaƱeda (2014) Optimal general offset assignment.
Published In: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems - SCOPES '14 ACM 2014, pp. 50-59.

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.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: UNSPECIFIED
Depositing User: Sven Mallach
Date Deposited: 16 Jun 2014 13:23
Last Modified: 16 Jun 2014 13:23
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/804