Revision as of 23:43, 13 March 2010 edit 78.86.152.142 (talk) Descriptions wrong and confusing ← Previous edit		Revision as of 22:23, 20 April 2010 edit undo 71.168.244.200 (talk) →Algorithms Next edit →
Line 24: == Algorithms == The simplest algorithm to find a topological sort is frequently used and is known as ~~'''~~[[list scheduling~~'''~~]]. Conceptually, it repeatedly selects a source of the dependency graph, appends it to the current instruction schedule and removes it from the graph. This may cause other vertices to be sources, which will then also be considered for scheduling. The algorithm terminates if the graph is empty. To arrive at a good schedule, stalls should be prevented. This is determined by the choice of the next instruction to be scheduled. A number of heuristics are in common use:

Instruction scheduling: Difference between revisions