Zhu, Y. and McCreary, C., "Optimal and Near Optimal Tree Scheduling for Parallel Systems", Fourth IEEE symposium on Parallel and Distributed Processing., Dec. 1992, pp. 112-119. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Static Scheduling Algorithms for Allocating Directed Task.. - Kwok, Ahmad (1998) (11 citations) (Correct)
....of the DAG and is then optimized by considering various cases of accounting for possible inter processor communication, which may in turn induce new critical paths. Finally, the vertical layers of nodes are mapped to the given processors in order to minimize the schedule length. Zhu and McCreary [176] reported a set of BNP scheduling algorithms for trees. They first devised an algorithm for finding optimal schedules for trees, in particular, binary trees. Nonetheless the algorithm is of exponential complexity since optimal scheduling of trees is an NP complete problem. They then proposed a ....
Y. Zhu and C.L. McCreary, "Optimal and Near Optimal Tree Scheduling for Parallel Systems," Proceedings of Symposium on Parallel and Distributed Processing, 1992, pp. 112119.
Partitioning for Parallelization Using Graph Parsing - McCreary (1991) Self-citation (Mccreary) (Correct)
....(linear) clan. Figure 4.4 Linear sequence of independent clans (a) Sequence of independent clans (b) Parsetree 5. Comparison of Partitioning Methods Many partitioning techniques have been proposed. Some techniques fail to account for communication overhead[3] target only one class of problem[9][25], or minimize communication without regard to execution time[24] Additional strategies attempt to map the graph of a particular algorithm or set of algorithms onto the physical layout of some architecture with primitive or no communication measurements[2] Techniques that analyze the PDG usually ....
Zhu, Y. and McCreary, C., "Optimal and Near Optimal Tree Scheduling for Parallel Systems", Fourth IEEE symposium on Parallel and Distributed Processing., Dec. 1992, pp. 112-119.
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