Samuel Midkiff is a Professor of Electrical and Computer Engineering at Purdue University, where he has been since 2001.He received his PhD degree from the University of Illinois at Urbana-Champaign in 1992 where he was a member of the Cedar project. In 1991 he became a Research Staff Member at the IBM T.J. Watson Research Center, where he was a key member of the xlhpf compiler team and the Numerically INtensive Java (Ninja) project. His research has focused on parallelism and high performance computing, and in particular compiler and language support for the development of correct and efficient programs. To this end, his research has covered dependence analysis and automatic synchronization of explicitly parallel programs, compilation under different memory models,automatic parallelization, high performance computing in Java and other high-level languages,and tools to help in the detection and localization of program errors.

• Introduction and overview.- Dependence analysis, dependence graphs and alias analysis.- Program parallelization.- Transformations to modify and eliminate dependences.- Transformation of iterative and recursive constructs.- Compiling for distributed memory machines.- Solving Diophantine equations.- A guide to further reading.

Samuel Midkiff is a Professor of Electrical and Computer Engineering at Purdue University, where he has been since 2001.He received his PhD degree from the University of Illinois at Urbana-Champaign in 1992 where he was a member of the Cedar project. In 1991 he became a Research Staff Member at the IBM T.J. Watson Research Center, where he was a key member of the xlhpf compiler team and the Numerically INtensive Java (Ninja) project. His research has focused on parallelism and high performance computing, and in particular compiler and language support for the development of correct and efficient programs. To this end, his research has covered dependence analysis and automatic synchronization of explicitly parallel programs, compilation under different memory models,automatic parallelization, high performance computing in Java and other high-level languages,and tools to help in the detection and localization of program errors.

• Introduction and overview.- Dependence analysis, dependence graphs and alias analysis.- Program parallelization.- Transformations to modify and eliminate dependences.- Transformation of iterative and recursive constructs.- Compiling for distributed memory machines.- Solving Diophantine equations.- A guide to further reading.

Samuel Midkiff is a Professor of Electrical and Computer Engineering at Purdue University, where he has been since 2001.He received his PhD degree from the University of Illinois at Urbana-Champaign in 1992 where he was a member of the Cedar project. In 1991 he became a Research Staff Member at the IBM T.J. Watson Research Center, where he was a key member of the xlhpf compiler team and the Numerically INtensive Java (Ninja) project. His research has focused on parallelism and high performance computing, and in particular compiler and language support for the development of correct and efficient programs. To this end, his research has covered dependence analysis and automatic synchronization of explicitly parallel programs, compilation under different memory models,automatic parallelization, high performance computing in Java and other high-level languages,and tools to help in the detection and localization of program errors.

• Introduction and overview.- Dependence analysis, dependence graphs and alias analysis.- Program parallelization.- Transformations to modify and eliminate dependences.- Transformation of iterative and recursive constructs.- Compiling for distributed memory machines.- Solving Diophantine equations.- A guide to further reading.