Block Scheduling: determ vs nondeterm

In order to remove as many jumps from one basic block to another, I
understand that one needs to perform block scheduling, much like
instruction scheduling. However, I've never written a block scheduler and
don't know what the traditional approach is. My first inclination is to
write a non-deterministic block scheduler using a genetic algorithm to
obtain a soltuion that is "good enough." Are traditional block schedulers
deterministic? If so, what is the basic approach? Have others written
non-deterministic block schedulers? If so, again what was the basic
approach?


paullong@delphi.com
--

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