Re: Mixed Mode Execution and Register Allocation

John Pieper <pieper@zko.dec.com>
30 May 1998 11:45:26 -0400

          From comp.compilers
Related articles
Mixed Mode Execution and Register Allocation hjl@dcs.ed.ac.uk (1998-05-15)
Re: Mixed Mode Execution and Register Allocation andi@complang.tuwien.ac.at (1998-05-23)
Re: Mixed Mode Execution and Register Allocation cliff.click@Eng.Sun.COM (Clifford Click) (1998-05-23)
Re: Mixed Mode Execution and Register Allocation pieper@zko.dec.com (John Pieper) (1998-05-30)
Re: Mixed Mode Execution and Register Allocation cliff.click@Eng.Sun.COM (Clifford Click) (1998-05-30)
| List of all articles for this month |
From: John Pieper <pieper@zko.dec.com>
Newsgroups: comp.compilers
Date: 30 May 1998 11:45:26 -0400
Organization: Digital Equipment Corporation
References: 98-05-105 98-05-116
Keywords: registers, optimize

Andreas Krall wrote:
> expensive register allocation algorithms in Java JIT's don't pay back
> the higher compile cost at run time in most applications.


There are , of scourse, cheaper algorithms for allocating registers than
graph-coloring. See for example Omri Traub's paper coming up at PLDI'98.
(see http://www.eecs.harvard.edu/hube/)
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.