A Spectral Method for Mapping Dataaow Graphs a Spectral Method for Mapping Dataaow Graphs 2 Min-cut Mapping for Dataaow Graphs 17 3 State-of-the-art Mapping and Scheduling 30

Acknowledgements First of all, I would like to thank my parents who not only gave me every possible personal and material support during my studies, but are also responsible for my decision to do science rather than to look for a decent job: they left \Scientiic American" on our living room table during my childhood. I am also grateful to my advisor, Professor Karsten Schwan, who has created an excellent environment for study and research at Georgia Tech and has provided me with many valuable ideas in our discussions. I wish to thank Prof. Mackenzie and Prof. Yalamanchili for taking the time to be on my thesis committee. During my stay at Georgia Tech, I have been supported by a Fulbright grant and a scholarship of the \Studienstiftung des deutschen Volkes". Beth Plale and Greg Eisenhauer have helped me during my struggles with the atmospheric modeling application. Aparna Pappu, Peter Ilberg and Joerg Lepler have provided me with style les and moral support during my thesis work. This thesis is typeset in L A T E X, with diagrams generated by \gnuplot". I am indebted to the innumerable programmers that have contributed to the free software I have used during my studies. Prof. Henry Wolkowicz (Waterloo) and Prof. Takeshi Tokuyama (Tokyo) have given me valuable references. ii Contents 1 The dataaow graph model 6

[1]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[2]  Reinhold Schneider,et al.  Numerische Simulation auf massiv parallelen Rechnern , 2003 .

[3]  Arnold Neumaier,et al.  Introduction to Numerical Analysis , 2001 .

[4]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[5]  Kourosh Gharachorloo,et al.  Shasta: a low overhead, software-only approach for supporting fine-grain shared memory , 1996, ASPLOS VII.

[6]  S.T. Barnard,et al.  PMRSB: Parallel Multilevel Recursive Spectral Bisection , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[7]  Joel H. Saltz,et al.  Multiprocessor Runtime Support for Fine-Grained, Irregular Dags , 1995, Parallel Process. Lett..

[8]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Karsten Schwan,et al.  MD—a flexible framework for high-speed parallel molecular dynamics , 1994 .

[10]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[11]  Greg Eisenhauer,et al.  A machine independent interface for lightweight threads , 1994, OPSR.

[12]  Tao Yang,et al.  List Scheduling With and Without Communication Delays , 1993, Parallel Comput..

[13]  Jake K. Aggarwal,et al.  A Generalized Scheme for Mapping Parallel Algorithms , 1993, IEEE Trans. Parallel Distributed Syst..

[14]  James C. Browne,et al.  The CODE 2.0 graphical parallel programming language , 1992, ICS '92.

[15]  Seth Copen Goldstein,et al.  Active Messages: A Mechanism for Integrated Communication and Computation , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[16]  Scott F. Midkiff,et al.  Heuristic Technique for Processor and Link Assignment in Multicomputers , 1991, IEEE Trans. Computers.

[17]  David C. Cann,et al.  A Report on the Sisal Language Project , 1990, J. Parallel Distributed Comput..

[18]  J. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[19]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[20]  R. M. Mattheyses,et al.  A linear-time heuristic for improving network partitions , 1988, DAC 1982.

[21]  W. Washington,et al.  An Introduction to Three-Dimensional Climate Modeling , 1986 .

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

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  H. Mine,et al.  ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS , 1976 .

[25]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[26]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[27]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[28]  K. Ritter,et al.  A method for solving nonlinear maximum-problems depending on parameters , 1967 .