6 citations found. Retrieving documents...
W. mei W. Hwu and P. P. Chang. Inline function expansion for compiling C programs. In SIGPLAN '89 Conference on Programming Language Design and Implementation, volume 24, pages 246--255, June 1989. SIGPLAN Notices 24(6).

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The Design and Implementation of the SELF Compiler, an.. - Chambers (1992)   (3 citations)  (Correct)

....known as inlining, procedure integration, and beta reduction. Some languages, including C , provide mechanisms through which the programmer can tell the compiler to inline calls to particular routines. More sophisticated systems attempt to determine automatically which routines should be inlined [Sch77, AJ88, HC89, RG89, McF91]. Inlining itself is not a particularly difficult transformation, but it is harder to devise a set of good heuristics to control automatic inlining, balancing compiled code space and compilation time increases against projected run time performance improvements and operating correctly in the ....

Wen-mei W. Hwu and Pohua P. Chang. Inline Function Expansion for Compiling C Programs. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pp. 246-257, Portland, OR, June, 1989. Published as SIGPLAN Notices 24(7), July, 1989.


Obtaining Sequential Efficiency for Concurrent.. - Plevyak, Zhang, Chien (1995)   (29 citations)  (Correct)

....for efficiency [4, 8, 18, 29, 32, 40] Our work also draws on developments in both the sequential and parallel compiler community. While most of our techniques are familiar ones, we have adapted them significantly to the COOP model. Many researchers have studied inlining for sequential languages [2, 28, 34]; however, their main concern is different from our focus on concurrency and locality. Our inlining techniques are most similar to the ones used in the SELF compiler [6, 7, 24] in their requirement for accurate type information and customization to enable inlining, speculative optimizations, and ....

Wen-mei W. Hwu and Pohua P. Chang. Inline function expansion for compiling C programs. In Proceedings of the 1989 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 246--257, June 1989.


Practical Techniques For Virtual Call Resolution In Java - Sundaresan (1999)   (2 citations)  (Correct)

....become more e ective in the presence of inlining in their performance results. We only report the raw improvement that method inlining has on performance as the rest of our framework is not developed enough to perform some of the global optimizations that they perform. 16 The work by Hwu et al.[31] focuses on the e ectiveness of inlining in reducing the number of dynamic function calls for C programs on their IMPACT system. In related work on the same system Chang et al. 16] report a mean speedup of 11 with a maximum speedup of 46 . Their benchmarks are largely under 5000 lines of C code, ....

....improvement in performance as a result of performing our optimization on a set of benchmarks in Chapter 4. This optimization has been implemented on the Jimple intermediate representation and the Soot framework is used to produce optimized class les. 44 3. 1 Method Inlining Method inlining [14, 11, 31, 16, 20, 21, 18, 19, 17, 34, 28, 10] is an optimization technique that has been used by optimizing compilers traditionally for both procedural and object oriented languages. The basic idea in method inlining is to statically replace a method invocation instruction by the code representing the body of the method that is the target of ....

Wen mei W. Hwu and Pohua P. Chang. Inline function expansion for compiling C programs. In Bruce Knobe, editor, Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation (SIGPLAN '89), pages 246-257, Portland, OR, USA, June 1989. ACM Press.


Call Graph Analysis in the Presence of Higher-Order Functions - Dean   (Correct)

.... has developed algorithms for many areas of optimization, including interprocedural constant propagation [Wegman Zadeck 85] alias analysis [Landi Ryder 92] parallelization of loops containing procedure calls [Hall et al. 91] interprocedural register allocation [Wall 86] and inlining [Hwu Chang 89] All of these algorithms that apply interprocedural analysis require that a representation of the program s calling structure exists, just as intraprocedural analyses require a representation of the control flow within a procedure. Typically this takes the form of a call multigraph 1 , with ....

Wen-Mei Hwu and Pohua P. Chang. Inline function expansion for compiling C programs. SIGPLAN Notices, 24(7):246--257, July 1989. In Proceedings of the ACM 21 Call Graph Analysis in the Presence of Higher-Order Functions Generals Examination Written Report SIGPLAN '89 Conference on Programming Language Design and Implementation.


Adaptive Online Context-Sensitive Inlining - Hazelwood, Grove (2003)   (6 citations)  (Correct)

No context found.

W. mei W. Hwu and P. P. Chang. Inline function expansion for compiling C programs. In SIGPLAN '89 Conference on Programming Language Design and Implementation, volume 24, pages 246--255, June 1989. SIGPLAN Notices 24(6).


Adaptive Online Context-Sensitive Inlining - Hazelwood, Grove (2003)   (6 citations)  (Correct)

No context found.

W. mei W. Hwu and P. P. Chang. Inline function expansion for compiling C programs. In SIGPLAN '89 Conference on Programming Language Design and Implementation, volume 24, pages 246--255, June 1989. SIGPLAN Notices 24(6).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC