|Progress in instruction scheduling? firstname.lastname@example.org (Stephan Ceram) (2008-03-17)|
|Re: Progress in instruction scheduling? email@example.com (=?UTF-8?B?IO+7i++7pO+6riDvuqnvu6vvu6Dvu67vu68=?=) (2008-03-18)|
|Re: Progress in instruction scheduling? firstname.lastname@example.org (Ivan Boldyrev) (2008-03-19)|
|Re: Progress in instruction scheduling? SidTouati@inria.fr (Sid Touati) (2008-04-22)|
|From:||Stephan Ceram <email@example.com>|
|Date:||17 Mar 2008 21:10:18 GMT|
|Posted-Date:||18 Mar 2008 00:03:44 EDT|
the compiler optimization "instruction scheduling" is a quite old
technique that can be found in many modern compilers. From some
standard compiler books, I got to know that many schedulers are based
on "list scheduling" which seems to be the standard approach. An
advanced approach based on profiling is "trace scheduling".
I would like to hear your opinion if there is/was any progress in the
last years concerning instruction scheduling leading to more advanced
techniques now considered to be standard or if scheduling based on
list scheduling is still state-of-the with no major deviations?
The reason I'm asking is that I want to write a master's thesis about
instruction scheduling for a research compiler. The compiler is for an
TI DSP which has two pipelines (integer and load/store pipeline) and
I'm looking for some challenges that should go beyond the standard
approaches which can be found in standard compiler books and thus
easily adapted. So, any advices are appreciated.
Return to the
Search the comp.compilers archives again.