| Algorithms for address assignment in DSP code generation |
| Full text |
Publisher Site
,
Pdf
(205 KB)
|
| Source
|
International Conference on Computer Aided Design
archive
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
table of contents
San Jose, California, United States
Pages: 109 - 112
Year of Publication: 1997
ISBN:0-8186-7597-7
|
|
Authors
|
|
Rainer Leupers
|
University of Dortmund, Department of Computer Science 12, 44221 Dortmund, Germany
|
|
Peter Marwedel
|
University of Dortmund, Department of Computer Science 12, 44221 Dortmund, Germany
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 11, Citation Count: 41
|
|
|
ABSTRACT
This paper presents DSP code optimization techniques, which originate from dedicated memory address generation hardware. We define a generic model of DSP address generation units. Based on this model, we present efficient heuristics for computing memory layouts for program variables, which optimize utilization of parallel address generation units. Improvements and generalizations of previous work are described, and the efficacy of the proposed algorithms is demonstrated through experimental evaluation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
V. Zivojnovic, J.M. Velarde, C. Schl~ger: DSPStone- A DSP-oriented Benchmarking Methodology, Technical Report, Dept. of EE, University of Aachen, Germany, 1994
|
| |
2
|
P. M~rw~a~l, G. Gooss~ns (~as.)" Cod~ a~tio~ fo~ Embedded Processors, Kluwer Academic Publishers, 1995
|
| |
3
|
|
 |
4
|
Stan Liao , Srinivas Devadas , Kurt Keutzer , Steve Tjiang , Albert Wang, Storage assignment to decrease code size, Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, p.186-195, June 18-21, 1995, La Jolla, California, United States
|
| |
5
|
|
 |
6
|
Clifford Liem , Pierre Paulin , Ahmed Jerraya, Address calculation for retargetable compilation and exploration of instruction-set architectures, Proceedings of the 33rd annual conference on Design automation, p.597-600, June 03-07, 1996, Las Vegas, Nevada, United States
[doi> 10.1145/240518.240631]
|
| |
7
|
L.A. Belady: A Study of Replacement Algorithms for a Virtual-Storage Computer, IBM System Journal 5(2): pp. 78-101, 1966
|
CITED BY 41
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Markus Lorenz , David Koffmann , Steven Bashford , Rainer Leupers , Peter Marwedel, Optimized address assignment for DSPs with SIMD memory accesses, Proceedings of the 2001 conference on Asia South Pacific design automation, p.415-420, January 2001, Yokohama, Japan
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
P. R. Panda , F. Catthoor , N. D. Dutt , K. Danckaert , E. Brockmeyer , C. Kulkarni , A. Vandercappelle , P. G. Kjeldsberg, Data and memory optimization techniques for embedded systems, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.6 n.2, p.149-206, April 2001
|
|
|
Ashok Sudarsanam , Stan Liao , Srinivas Devadas, Analysis and evaluation of address arithmetic capabilities in custom DSP architectures, Proceedings of the 34th annual conference on Design automation, p.287-292, June 09-13, 1997, Anaheim, California, United States
|
|
|
M. Miranda , C. Ghez , C. Kulkarni , F. Catthoor , D. Verkest, Systematic speed-power memory data-layout exploration for cache controlled embedded multimedia applications, Proceedings of the 14th international symposium on Systems synthesis, September 30-October 03, 2001, Montréal, P.Q., Canada
|
|
|
|
|
|
Gert Goossens , Johan Van Praet , Dirk Lanneer , Werner Geurts , Augusli Kifli , Clifford Liem , Pierre G. Paulin, Embedded software in real-time signal processing systems: design technologies, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
|
|
|
Sumit Gupta , Miguel Miranda , Francky Catthoor , Rajesh Gupta, Analysis of high-level address code transformations for programmable processors, Proceedings of the conference on Design, automation and test in Europe, p.9-13, March 27-30, 2000, Paris, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Basu , R. Leupers , P. Marwedel, Register-constrained address computation in DSP programs, Proceedings of the conference on Design, automation and test in Europe, p.929-930, February 23-26, 1998, Le Palais des Congrés de Paris, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sean Leventhal , Lin Yuan , Neal K. Bambha , Shuvra S. Bhattacharyya , Gang Qu, DSP address optimization using evolutionary algorithms, Proceedings of the 2005 workshop on Software and compilers for embedded systems, p.91-98, September 29-October 01, 2005, Dallas, Texas
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ittetsu Taniguchi , Murali Jayapala , Praveen Raghavan , Francky Catthoor , Keishi Sakanushi , Yoshinori Takeuchi , Masaharu Imai, Systematic architecture exploration based on optimistic cycle estimation for low energy embedded processors, Proceedings of the 2009 Conference on Asia and South Pacific Design Automation, January 19-22, 2009, Yokohama, Japan
|
|