Article

Free access

Call forwarding: a simple interprocedural optimization technique for dynamically typed languages

Authors:

Koen De Bosschere,

Sampath KannanAuthors Info & Claims

POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 409 - 420

https://doi.org/10.1145/174675.178041

Published: 01 February 1994 Publication History

Abstract

This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: find an ordering for the “entry actions” of a procedure, and generate multiple entry points for the procedure, so as to maximize the savings realized from different call sites bypassing different sets of entry actions. We show that the problem of computing optimal solutions to arbitrary call forwarding problems is NP-complete, and describe an efficient greedy algorithm for the problem. Experimental results indicate that (i) this algorithm is effective, in that the solutions produced are generally close to optimal; and (ii) the resulting optimization leads to significant performance improvements for a number of benchmarks tested.

References

[1]

A. Appel, Compiling with Continuations, Cambridge University Press, 1992.

Digital Library

[2]

A. V. Aho, R. Sethi and J. D. Ullman, Compilers - Principles, Techniques and Tools, Addison-Wesley, 1986.

Digital Library

[3]

T. Ball and J. Larus, "Optimally Profiling and Tracing Programs", Proc. 19th. A CM Symp. on Principles of Programming Languages, Albuquerque, NM, Jan. 1992, pp. 59-70.

Digital Library

[4]

M. Carlsson and J. Widen, SICStus Prolog User's Manual, Swedish Institute of Computer Science, Oct. 1988.

[5]

C. Chambers and D. Ungar, "Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically Typed Object-Oriented Programs", Proc. SIGPLAN '90 Conference on Programming Language Design and implementation, White Plains, NY, June 1990, pp. 150-164. SIG- PLAN Notices vol. 25 no. 6.

Digital Library

[6]

C. Chambers, D. Ungar and E. Lee, "An Efficient Implementation of SELF, A Dynamically Typed Object-Oriented Language Based on Prototypes", Proc. OOPSLA '89, New Orleans, LA, 1989, pp. 49-7O.

Digital Library

[7]

S. K. Debray, "A Simple Code Improvement Scheme for Prolog", J. Logic Programming, vol. 13 no. 1, May 1992, pp. 57-88.

Digital Library

[8]

M. R. G arey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, New York, 1979.

Digital Library

[9]

M. R. Garey, D. S. Johnson, and L. Stockmeyer, "Some Simplified NP-complete Graph Problems", Theoretical Computer Science vol. 1, pp. 237-267, 1976.

[10]

A. Goldberg and D. Robson, Smalltalk-80: The Language and its Implementation, Addison-Wesley, 1983.

Digital Library

[11]

D. Gudeman, K. De Bosschere, and S. K. Debray, "jc : An Efficient and Portable Implementation of Janus", Proc. Joint International Conference and Symposium on Logic Programming, Washington DC, Nov. 1992. MIT Press.

[12]

A. Mari~n, G. janssens, A. Mulkers, and M. Bruynooghe, "The Impact of Abstract Interpretation: An Experiment in Code Generation", Proc. Sixth International Conference on Logic Programming, Lisbon, June 1989, pp. 33-47. MIT Press.

[13]

V. Saraswat, K. Kahn, and J. Levy, "Janus: A step towards distributed constraint programming", in Proc. 1990 North A memcan Conference on Logic Programming, Austin, TX, Oct. 1990, pp. 431-446. MIT Press.

Digital Library

[14]

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg, Programming with Sets: An Introduction to SETL, Springer-Verlag, 1986.

Digital Library

[15]

G. L. Steele Jr., Common Lisp: The Language, Digital Press, 1984.

Digital Library

[16]

A. Taylor, "Removal of Dereferencing and Trailing in Prolog Compilation", Proc. Sixth International Conference on Logic Programming, Lisbon, June 1989, pp. 48-60. MIT Press.

[17]

K. Ueda, "Guarded Horn Clauses", in Concurrent Prolog: Collected Papers, vol. 1, ed. E. Shapiro, pp. 140-156, 1987. MIT Press.

Digital Library

[18]

P. Van Roy, Can Logic Programming Execute as Fast as Imperative Programming?, PhD Dissertation, University of California, Berkeley, Nov. 1990.

Digital Library

[19]

D. W. Wall, "Predicting Program Behavior Using Real or Estimated Profiles", Proc. SIGPLAN-91 Conf. on Programming Language Design and Implementation, June 1991, pp. 59-70.

Digital Library

Cited By

Goubault J(2005)Generalized boxings, congruences and partial inliningStatic Analysis10.1007/3-540-58485-4_38(147-161)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-58485-4_38
Blume MAppel A(1997)Lambda-splittingACM SIGPLAN Notices10.1145/258949.25896032:8(112-124)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/258949.258960
Tarau PDe Bosschere KDemoen B(1997)On Delphi lemmas and other memoing techniques for deterministic logic programsThe Journal of Logic Programming10.1016/S0743-1066(96)00105-730:2(145-163)Online publication date: Feb-1997
https://doi.org/10.1016/S0743-1066(96)00105-7
Show More Cited By

Index Terms

Call forwarding: a simple interprocedural optimization technique for dynamically typed languages
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Mitigating transient loops through interface-specific forwarding

Under link-state routing protocols such as OSPF and IS-IS, when there is a change in the topology, propagation of link-state advertisements, path recomputation, and updating of forwarding tables (FIBs) will all incur some delay before traffic forwarding ...
A new artificial bee colony algorithm employing intelligent forager forwarding strategies
Abstract
Artificial Bee Colony (ABC) algorithm that mimics the intelligent foraging behaviors of real honey bees has been successfully applied to different types of optimization problems in recent years. Actually, the main reason lying behind ...
Highlights
- A new variant of ABC called intelligent forager forwarding ABC (iff-ABC) was proposed.
Precise Call Graphs for C Programs with Function Pointers

The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses through pointer dereferences, as well as indirect procedure calls (e.g., ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

February 1994

492 pages

ISBN:0897916360

DOI:10.1145/174675

Chairmen:
Hans-J. Boehm
Xerox PARC
,
Bernard Lang
INRIA Rocquencourt
,
Daniel Yellin
IBM Watson Research Center

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL94

Sponsor:

POPL94: 21st ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages

January 16 - 19, 1994

Oregon, Portland, USA

Acceptance Rates

POPL '94 Paper Acceptance Rate 39 of 173 submissions, 23%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
274
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)5

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Goubault J(2005)Generalized boxings, congruences and partial inliningStatic Analysis10.1007/3-540-58485-4_38(147-161)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-58485-4_38
Blume MAppel A(1997)Lambda-splittingACM SIGPLAN Notices10.1145/258949.25896032:8(112-124)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/258949.258960
Tarau PDe Bosschere KDemoen B(1997)On Delphi lemmas and other memoing techniques for deterministic logic programsThe Journal of Logic Programming10.1016/S0743-1066(96)00105-730:2(145-163)Online publication date: Feb-1997
https://doi.org/10.1016/S0743-1066(96)00105-7
Lindgren T(1996)Polyvariant detection of uninitialized arguments of prolog predicatesThe Journal of Logic Programming10.1016/0743-1066(96)00050-728:3(217-229)Online publication date: Sep-1996
https://doi.org/10.1016/0743-1066(96)00050-7
Debray SJones N(1995)Abstract interpretation and low-level code optimizationProceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/215465.215571(111-121)Online publication date: 23-Jun-1995
https://dl.acm.org/doi/10.1145/215465.215571
Debray SDe Bosschere KGudeman D(1994)Call Forwarding: A Simple Low-Level Code Optimization TechniqueImplementations of Logic Programming Systems10.1007/978-1-4615-2690-2_6(77-88)Online publication date: 1994
https://doi.org/10.1007/978-1-4615-2690-2_6

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents