Code optimization by integer linear programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1575, Issue , 1999, Pages 122-137

  Kästner, Daniel ^a   Langenbach, Marc ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CODES (SYMBOLS); COMMERCE; DIGITAL SIGNAL PROCESSING; DIGITAL SIGNAL PROCESSORS; HIGH LEVEL LANGUAGES; PROGRAM COMPILERS;

CODE GENERATION ALGORITHM; CODE OPTIMIZATION; DSP ARCHITECTURES; EMBEDDED APPLICATION; INSTRUCTION SCHEDULING; INTEGER LINEAR PROGRAMMING; PROBLEM DESCRIPTION; REGISTER ASSIGNMENT;

INTEGER PROGRAMMING;

EID: 84949201132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49051-7_9     Document Type: Conference Paper

References (29)

1. Analog Devices. ADSP-2106x SHARC User’s Manual, 1995.
2. Siamak Arya. An Optimal Instruction Scheduling Model for a Class of Vector Processors. IEEE Transactions on Computers, C-34, November 1985.
3. Ulrich Bieker and Steven Bashford. Scheduling, Compaction and Binding in a Retargetable Code Generator Using Constraint Logic Programming.4. GI/ITG/GME Workshop “Methoden des Entwurfs und der Verifikation digitaler Systeme”, March 1996. Kreischa, Germany.
4. D. G. Bradlee. Retargetable Instruction Scheduling for Pipelined Processors. Phd thesis, Technical Report 91-08-07, University of Washington, 1991.
5. P. Briggs, K. Cooper, and L. Torczon. Improvements to Graph Coloring Register Allocation. ACM Transactions on Programming Languages and Systems, 16(3):428–455, 1994.
6. D. Callahan and B. Koblenz. Register Allocation via Hierarchical Graph Coloring. Proceedings of the ACM PLDI Conference, pages 192–202, 1991.
7. S. Chaudhuri, R.A. Walker, and J.E. Mitchell. Analyzing and Exploiting the Structure of the Constraints in the ILP-Approach to the Scheduling Problem. IEEE Transactions on Very Large Scale Integration (VLSI) System, 2(4):456–471, December 1994.
8. J.A. Fisher. Trace Scheduling: A Technique for Global Microcode Compaction. IEEE Transactions on Computers, C-30(7):478–490, July 1981.
9. C. H. Gebotys and M.I. Elmasry. Optimal VLSI Architectural Synthesis. Kluwer Academic, 1992.
10. C. H. Gebotys and M.I. Elmasry. Global Optimization Approach for Architectural Synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-12(9):1266–1278, September 1993.
11. R. Govindarajan, Erik R. Altman, and Guang R. Gao. A Framework for Resource Constrained Rate Optimal Software Pipelining. IEEE Transactions on Parallel and Distributed Systems, 7(11), November 1996.
12. Rajiv Gupta and Mary Lou Soffa. Region scheduling: An approach for detecting and redistributing parallelism. IEEE Transactions on Software Engineering, 16(4):421–431, 1990.
13. Silvina Hanono and Srinivas Devadas. Instruction Scheduling, Resource Allocation, and Scheduling in the AVIV Retargetable Code Generator. In Proceedings of the DAC 1998, San Francisco, California, 1998. ACM.
14. Daniel Kästner. Instruktionsanordnung und Registerallokation auf der Basis ganzzahliger linearer Programmierung für den digitalen Signalprozessor ADSP-2106x. Master’s thesis, University of the Saarland, 1997.
15. Daniel Kästner and Marc Langenbach. Integer Linear Programming vs. Graph Based Methods in Code Generation. Technical Report A/01/98, University of the Saarland, Saarbrücken, Germany, January 1998.
16. David Landskov, Scott Davidson, Bruce Shriver, and Patrick W. Mallet. Local Microcode Compaction Techniques. ACM Computing Surveys, 12(3):261–294, 1980.
17. Marc Langenbach. Instruktionsanordnung unter Verwendung graphbasierter Algorithmen für den digitalen Signalprozessor ADSP-2106x. Master’s thesis, University of the Saarland, 1997.
18. Rainer Leupers. Retargetable Code Generation for Digital Signal Processors. Kluwer Academic Publishers, 1997.
19. G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, editors. Handbooks in Operations Research and Management Science, volume 1 of Handbooks in Operations Research and Management Science. North-Holland, Amsterdam; New York; Oxford, 1989.
20. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley and Sons, New York, 1988.
21. Alexandru Nicolau. Uniform parallelism exploitation in ordinary programs. In International Conference on Parallel Processing, pages 614–618. IEEE Computer Society Press, August 1985.
22. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, 1982.
23. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization, Algorithms and Complexity, chapter 13, pages 318–322. Prentice-Hall, Englewood Cliffs, 1982.
24. John Ruttenberg, G.R. Gao, A. Stoutchinin, and W. Lichtenstein. Software Pipelining Showdown: Optimal vs. Heuristic Methods in a Production Compiler. Proceedings of the 1996 ACM SIGPLAN Conference on Programming Languages Design and Implementation (PLDI 96), 31(5):1–11, May 1996.
25. M.A.R. Saghir, P. Chow, and C.G. Lee. Exploiting Dual Data-Memory Banks in Digital Signal Processors. http://www.eecg.toronto.edu/~saghir/papers/asplos7.ps, 1996.
26. SPAM Research Group, http://www.ee.princeton.edu/spam. SPAM Compiler User’s Manual, September 1997.
27. Ashok Sudarsanam. Code Optimization Libraries for Retargetable Compilation for Embedded Digital Signal Processors. PhD thesis, University of Princeton, November 1998.
28. Tom Wilson, Gary Grewal, Shawn Henshall, and Dilip Banerji. An ILP-Based Approach to Code Generation. In Peter Marwedel and Gert Goossens, editors, Code Generation for Embedded Processors, chapter 6, pages 103–118. Kluwer, Boston; London; Dortrecht, 1995.
29. L. Zhang. SILP. Scheduling and Allocating with Integer Linear Programming. PhD thesis, University of the Saarland, Technical Faculty, 1996.