L. Dos Santos, et. al., "A Code-Motion Pruning Technique for Global Scheduling ", ACM Trans. Design Automation of Electronic Systems, vol. 5, no.3, pp. 1-33, Jan. 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automata-Based Symbolic Scheduling - Haynal (2000) (3 citations) (Correct)
....the scheduling scope includes: operand dependencies, controldependent behavior, sequential behavior and constraints, hardware resource constraints, repeating behavior, completeness and quality. Heuristic scheduling techniques are by far the most common [22] 25] 44] 45] 58] 68] 71] 104] 109] 110][121][132] 133] 134] All heuristics, and in fact all scheduling techniques, address operand dependencies. If a scheduling technique only considers operand dependencies, then it only schedules data flow graphs, DFGs. Within the DFG paradigm, there is considerable work regarding repeating or cyclic ....
....may suffer as only single solutions are found and protocols are not accommodated. Heuristics also exist for control dependent scheduling. The most influential early work is attributed to Wakabayshi[132] 133] Two recent state of the art heuristics are by Lakshminarayana[68] and Dos Santos[121]. Lakshminarayana s technique, which handles some repeating behaviors, uses an explicit breadth first elaboration of the available operations on each time step that is similar to the implicit NFA exploration used in ABSS. Dos Santos heuristic is guided by codemotion pruning and includes some ....
[Article contains additional citation context not shown here]
L. Dos Santos, et. al., "A Code-Motion Pruning Technique for Global Scheduling ", ACM Trans. Design Automation of Electronic Systems, vol. 5, no.3, pp. 1-33, Jan. 2000.
Exploiting Instruction-Level Parallelism: A constructive approach - Santos (1998) (2 citations) Self-citation (Santos) (Correct)
....the scope, the larger the search space becomes. As a consequence, we should also prune inferior solutions from the search space. Code motion pruning is a technique included in the parallelizer for this purpose, and it will be explained in Chapter 4. In early versions of our approach [56] 57][60], we neither used the notion of available operations at some state s k explicitly, nor we stressed the notion of current and next states. These notions were later incorporated, after the work presented in [4] since they allow us to extend the original approach with loop pipelining, as will be ....
L.C.V. dos Santos et al., "A Code--Motion Pruning Technique for Global Scheduling", to appear in: ACM Transactions on Design Automation of Electronic Systems, vol. 5, n. 2.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC