Evaluating inlining techniques

Computer Languages

Volumn 24, Issue 2-3, 1998, Pages 55-72

  Kaser, Owen ^a,b,c   Ramakrishnan, C R ^b,d,e  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b Stony Brook University   (United States)

^c BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE   (India)

^d ACADIA UNIVERSITY   (Canada)

^e STONY BROOK UNIVERSITY   (United States)

Author keywords

Comparison; Inline; Optimization; Version

Indexed keywords

OPTIMIZATION; PROGRAM DIAGNOSTICS;

INLINING TECHNIQUES;

PROGRAM COMPILERS;

EID: 0032114717     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0096-0551(98)00003-4     Document Type: Article

References (19)

1. Appel AW. Compiling with Continuations, Cambridge: Cambridge University Press, UK, 1992.
2. Bal HE, Tanenbaum AS. Language- and machine-independent global optimization on intermediate code. Journal of Computer Languages 1986;11:105-21.
3. Ball JE. Program Improvement by the Selective Integration of Procedure Calls. PhD thesis. University of Rochester, 1982.
4. Chang PP, Mahlke SA, Chen WY, Hwu Wen-mei W. Profile-guided automatic inline expansion for C programs. Software - Practice and Experience 1992;25:349-69.
5. Peyton-Jones SL, Santos A. Compilation by transformation in the Glasgow Haskell compiler. In: Functional Programming, Glasgow '94. Workshops in Computing, Springer-Verlag, 1994:184-204.
6. Scheifler RW. An analysis of inline substitution for a structured programming language. Communications of the ACM 1977;20(9):647-54.
7. Stallman RM. 1993. Using and Porting GCC. Free Software Foundation. For version 2.5.
8. Davidson JW, Holler AM. Subprogram inlining: A study of its effects on program execution time. IEEE Transactions on Software Engineering 1992;18:89-101.
9. Cooper KD, Hall MW, Torczon L. An experiment with inline substitution. Software - Practice and Experience 1991;21:581-601.
10. McFarling S. Procedure merging with instruction caches. In: Proc. of the SIGPLAN '91 Conference on Programming Language Design and Implementation, 1991:71-79.
11. Kaser O, Ramakrishnan CR, Pawagi S. On the conversion of indirect to direct recursion. ACM Letters on Programming Languages and Systems 1993;2(14):151-64.
12. Kaser O. Inlining to reduce stack space. In: International Symposium on Programming Language Implementation and Logis Programming (PLILP-93). Tallinn, Estonia, Springer-Verlag, LNCS 714, 1993.
13. Kaser O. Computational Aspects of Inlining. PhD thesis. SUNY at Stony Brook, 1993.
14. Deo N. Graph Theory with Applications to Engineering and Computer Science. Prentice Hall, 1974.
15. Krishnamurthy B. An improved min-cut algorithm for partitioning VLSI networks. IEEE Transactions on Computers 1984;C-33:438-46.
16. Kaser O, Ramakrishnan CR, Ramakrishnan IV, Sekar RC. EQUALS - a fast parallel implementation of a lazy language. Journal of Functional Programming 1997;7(2):183-215.
17. Hartel PH, Langendoen KG. Benchmarking implementations of lazy functional languages. In: ACM Conference on Functional Programming Languages and Computer Architecture (FPCA). New York, ACM, 1993:341-349.
18. O'Donnell MJ. Equational Logic as a Programming Language. In: Foundations of Computing. MIT Press, 1985.
19. Peyton-Jones SL. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.