RVM
  1. RVM
  2. RVM-428

Selective specialization driven by the online partial call graph

    Details

    • Type: Improvement Improvement
    • Status: Open Open
    • Priority: Minor Minor
    • Resolution: Unresolved
    • Affects Version/s: None
    • Fix Version/s: 1000
    • Component/s: Compiler: Optimizing
    • Labels:
      None
    • Number of attachments :
      0

      Description

      Implement the algorithm described in the paper "Selective Specialization for Object-Oriented Languages" (see http://domino.research.ibm.com/comm/research_people.nsf/pages/dgrove.pldi95.html ), but use the online partial call graph instead of offline profiling.

      The algorithm decides which methods to specialize based on the profile, and thus avoids over- or under-specialization. The advantage would be the speed-up of the specialization for methods where it benefits the most, while avoiding code bloat.

        Activity

        There are no comments yet on this issue.

          People

          • Assignee:
            Unassigned
            Reporter:
            David Mohr
          • Votes:
            0 Vote for this issue
            Watchers:
            0 Start watching this issue

            Dates

            • Created:
              Updated: