Universität zu Köln

Mallach, Sven ORCID: 0000-0001-5335-0678 (2015). More General Optimal Offset Assignment. Leibniz Transactions on Embedded Systems, 2 (1). 02-1-02-18. Dagstuhl Publishing, Germany.

Full text not available from this repository.

Abstract

This manuscript presents exact approaches to the general offset assignment problem arising in the address code generation phase of compilers for application-specific processors. First, integer programming models for architecture-dependent and theoretically motivated special cases of the problem are established. Then, these models are extended to provide the first widely applicable formulations for the most general problem setting, supporting processors with several address registers and complex addressing capabilities. Existing heuristics are similarly extended and practical applicability of the proposed methods is demonstrated by experimental evaluation using an established and large benchmark set. The experiments allow us to study the impact of exploiting more complex memory addressing capabilities on the address computation costs of real-world programs. We also show how to integrate operand reordering techniques for commutative instructions into existing solution approaches.

Item Type:	Article
Creators:	Creators Email ORCID ORCID Put Code Mallach, Sven UNSPECIFIED https://orcid.org/0000-0001-5335-0678 UNSPECIFIED
URN:	urn:nbn:de:hbz:38-640775
Identification Number:	10.4230/LITES-v002-i001-a002
Journal or Publication Title:	Leibniz Transactions on Embedded Systems
Volume:	2
Number:	1
Page Range:	02-1-02-18
Date:	June 2015
Publisher:	Dagstuhl Publishing, Germany
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/64077