Comparative Study of Static and Dynamic Heuristics for InliningMatthew

  • Arnold Stephen Fink Vivek Sarkar Peter F. SweeneyDepartment
  • Published 2000


In this paper, we present a comparative study of static and dynamic heuristics for inlining. We introduce inlining plans as a formal representation for nested inlining decisions made by an inlining heuristic. We use a well-known approximation algorithm for the knapsack problem as a common \meta-algorithm" for the static and dynamic inlining heuristics… (More)


  • Presentations referencing similar topics