Please use this identifier to cite or link to this item:
Title: Optimizing address assignment for scheduling embedded DSPs
Authors: Xue, C
Shao, Z
Sha, EHM
Xiao, B 
Issue Date: 2004
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), v. 3207, p. 64-73 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: DSP architecture typically provides indirect addressing modes with auto-increment and auto-decrement. Subsuming the address arithmetic into auto-increment and auto-decrement modes improves the size and performance of generated code. A lot of previous work has been done on address assignment optimization to achieve code size reduction by minimizing address operations for single functional unit processors. However, minimizing address operations alone may not directly reduce code size and schedule length for multiple-functional-unit processors. In this paper, we exploit address assignment and scheduling for multiple functional units processors. Our approach is to first construct a nice address assignment and then do scheduling. By fully taking advantage of the address assignment during scheduling, code size and schedule length can be significantly reduced. We propose a multiple-functional-unit algorithm to do both address assignment and scheduling. The experimental results show that our algorithm can greatly reduce code size and schedule length compared to the previous work.
Description: International Conference on Embedded and Ubiquitous Computing (EUC 2004), Aizu-Wakamatsu City, 25-27 Aug 2004
ISBN: 978-3-540-22906-3 (print)
978-3-540-30121-9 (online)
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-540-30121-9_7
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Jun 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.