|Instruction Scheduling? sanjoy@leland.Stanford.EDU (sanjoy ghosh) (1995-04-28)|
|From:||sanjoy ghosh <sanjoy@leland.Stanford.EDU>|
|Keywords:||architecture, optimize, question|
|Date:||Fri, 28 Apr 1995 17:36:01 GMT|
In Robert Blainey's paper on instruction scheduling for the RS6000 he looks
for instrunctions that are ready to schedle on a given cycle, and allocates
resources for them as he finds each ready instruction. If he finds another
ready instruction that needs the same resources that have already been
allocated to another instruction, he chooses between the two. If the
instruction that was given the resources turns out to have a lower priority
it gets evicted.
My question is instead of allocating resources to a ready instruction as soon
as it is found, why not collect all the ready instructions. Then sort them
by priority and allocate resources (for dispatch) in that order. This way
you avoid backtracking and the possibility of cycling.
What are the pros and cons of his approach versus the conventional way of
collecting and prioritizing all ready instructions before allocating resources?
Return to the
Search the comp.compilers archives again.