Extracting Both Affine and Non-linear Synchronization-Free Slices in Program Loops
暂无分享,去创建一个
[1] Yves Robert,et al. Scheduling and Automatic Parallelization , 2000, Birkhäuser Boston.
[2] Wlodzimierz Bielecki,et al. Extracting Synchronization-free chains of dependent iterations in non-uniform loops , 2007 .
[3] William Pugh,et al. Iteration space slicing and its application to communication optimization , 1997, ICS '97.
[4] Monica S. Lam,et al. An affine partitioning algorithm to maximize parallelism and minimize communication , 1999, ICS '99.
[5] Steve Alten,et al. Omega Project , 1978, Encyclopedia of Parallel Computing.
[6] Pierre Boulet,et al. Loop Parallelization Algorithms: From Parallelism Extraction to Code Generation , 1998, Parallel Comput..
[7] Allen,et al. Optimizing Compilers for Modern Architectures , 2004 .
[8] S. Akhter,et al. Multi-core programming , 2006 .
[9] Paul Feautrier. Toward Automatic Distribution , 1994, Parallel Process. Lett..
[10] William Pugh,et al. The Omega Library interface guide , 1995 .
[11] William Pugh,et al. An Exact Method for Analysis of Value-based Array Data Dependences , 1993, LCPC.
[12] Ken Kennedy,et al. Optimizing Compilers for Modern Architectures: A Dependence-based Approach , 2001 .
[13] Pierluigi San Pietro,et al. Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations , 2008, ICA3PP.