|Combined Instruction Scheduling aand Register Allocation firstname.lastname@example.org (2007-02-25)|
|Re: Combined Instruction Scheduling aand Register Allocation email@example.com (2007-02-26)|
|Re: Combined Instruction Scheduling aand Register Allocation firstname.lastname@example.org (2007-03-01)|
|Date:||1 Mar 2007 01:08:21 -0500|
|Posted-Date:||01 Mar 2007 01:08:21 EST|
> You might be interested in the Ph.D. thesis of Andrzej Bednarski, and
> in his other publications, and in papers he cites.
> - anton
Yes, that's probably a good start. Their work (materialized as the
OPTIMIST compiler prototype) attacks all three problems (code
selection, register allocation and instruction scheduling) by means of
dynamic and integer linear programming.
You understand of course, that the specific solution might be too slow
(serious number in orders of magnitude) for your purposes.
Return to the
Search the comp.compilers archives again.