Partitioning for Parallelization Using Graph Parsing

[1]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1987, TOPL.

[2]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[3]  Andrzej Ehrenfeucht,et al.  Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms , 1990, Theor. Comput. Sci..

[4]  Carolyn McCreary,et al.  Automatic determination of grain size for efficient parallel processing , 1989, CSC '89.

[5]  James C. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[6]  Janak H. Patel,et al.  The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm , 1989, International Conference on Parallel Processing.

[7]  Rolf H. Möhring,et al.  A Fast Algorithm for the Decomposition of Graphs and Posets , 1983, Math. Oper. Res..

[8]  Bruce M. Maggs,et al.  Communication-Efficient Parallel Graph Algorithms , 1986, ICPP.

[9]  Donald F. Towsley.  Allocating programs containing branches and loops within a multiple processor system , 1986, IEEE Transactions on Software Engineering.

[10]  Yahui Zhu,et al.  Optimal and near optimal tree scheduling for parallel systems , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[11]  D. H. Gill,et al.  Shortest Path Evaluation for Hierarchial Grain Aggregation , 1993 .

[12]  Dan I. Moldovan,et al.  Parallelism detection and transformation techniques useful for VLSI algorithms , 1985, J. Parallel Distributed Comput..

[13]  Tao Yang,et al.  On the Granularity and Clustering of Directed Acyclic Task Graphs , 1993, IEEE Trans. Parallel Distributed Syst..

[14]  Dennis Gannon,et al.  The characteristics of parallel algorithms , 1987 .

[15]  Phillip B. Gibbons.  A more practical PRAM model , 1989, SPAA '89.

[16]  Francine Berman,et al.  Performance prediction-How good is good? , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[17]  Andrzej Ehrenfeucht,et al.  Theory of 2-Structures, Part II: Representation Through Labeled Tree Families , 1990, Theor. Comput. Sci..

[18]  Jeremy P. Spinrad,et al.  Incremental modular decomposition , 1989, JACM.

[19]  Barbara M. Chapman,et al.  Supercompilers for parallel and vector computers , 1990, ACM Press frontier series.

[20]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[21]  Carolyn McCreary,et al.  Efficient Exploitation of Concurrency Using Graph Decomposition , 1990, ICPP.

[22]  Mihalis Yannakakis,et al.  Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.

[23]  C. L. McCreary.  An algorithm for parsing a graph grammar , 1987 .

[24]  C. L. McCreary,et al.  Hypercube Communication Performance , 1991 .