Function inlining versus function cloning

ACM SIGPLAN Notices

Volumn 38, Issue 4, 2003, Pages 18-24

  Das, Dibyendu ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

Cloning; Compilers; Inlining; Knapsack Problem

Indexed keywords

COST EFFECTIVENESS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; PROGRAM COMPILERS; SITE SELECTION;

FUNCTION CLONING; FUNCTION INLINING; KNAPSACK PROBLEM; SITE SELECTION PROBLEM;

FUNCTIONS;

EID: 33745622399     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/844091.844097     Document Type: Article

References (14)

1. M. Arnold, S. Fink, V. Sarkar, and P.P. Sweeney. A Comparative Study of Static and Pro le-Based Heuristics for Inlining. In The 2000 Dynamo Workshop on Dynamic Optimization, (Boston, MA), pages 52-6, 2000.
2. A. Ayers, R. Gottlieb, and R. Schooler. Aggressive Inlining. In Proceedings of the ACM SIGPLAN 97 Conference on Programming Language Design and Implementation, pages 134-145, 1997.
3. P. P. Chang, S. A. Mahlke, W. Y. Chen, and W. M. Hwu. Pro le-g uided Automatic Inline Expansion for C programs. Software Practice and Experience, 22(5), pages 349-369, May 1992.
4. K. D. Cooper, M. W. Hall, and Ken. Kennedy. A Methodology for Procedure Cloning. Computer Languages, May 1995.
5. K. D. Cooper, M. W. Hall, and L. Torczon. An Experiment with Inline Substitution. Software Practice and Experience, 21(6), pages 581-60, 1 June 1991.
6. J. W. Davidson and A. M. Holler. A Study of a C function Inliner. Software Practice and Experience, 18(8), pages 775-79, 0 August 1988.
7. K. Faxen. The Costs and Bene ts of Cloning in a Lazy Functional Language. Technical report, Dept. of Teleinformatics, KTH, Stockholm, 1999.
8. W. W. Hwu and P. P Chang. Inline Function Expansion for Compiling C programs. In Proceedings of the ACM SIGPLAN 89 Conference on Programming Language Design and Implementation, 1989.
9. T. Ibaraki, T. Hasegawa, K. Teranaka, and J. Iwase. The Multiple Choice Knapsack Problem. J. Oper. Res. Soc. Japan, 21, pages 59-9, 1978.
10. A. Martello and P. Toth. Knapsack Problems. Algorithms and Computational Implementations. Wiley, Chichester, 1990.
11. D. Pisinger. Algorithms for Knapsack Problems. PhD thesis, DIKU, University of Copenhagen, 1995.
12. R. W. Schei er. An Analysis of Inline Substitution for a Structured Programming Language. CACM, 20(9), September 1977.
13. A. Sinha and A. A. Zoltners. The Multiple-Choice Knapsack problem. Operation Research, 27, pages 503-5151979.
14. Tom Way and Lori Pollock. Using Path Spectra to Direct Function Cloning. Workshop on Pro le and Feedback-directed Compilation, PACT 1998.