Impact of Variable Privatization on Extracting Synchronization-Free Slices for Multi-core Computers
作者： Marek Palkowski
DOI: 10.1007/978-3-642-35893-7_7
关键词:
摘要: Variable Privatization is an important technique that has been used by compilers to parallelize loops eliminating storage-related dependences. In this paper, we present approach combines extracting synchronization-free slices available in program with variable privatization. This permits us reduce the number of dependence relations and as a consequence time complexity algorithms aimed at slices. leads enlarging scope applicability those reducing required loops. The illustrated means NAS Parallel Benchmark suite. Results performance analysis for parallelized executed on multi-core computer are presented. Received results compared obtained other loop parallelization techniques. future work outlined.
springer.com
sci-hub.st 参考文章(18)
Palkowski Marek, Automatic privatization for parallel execution of loops international conference on artificial intelligence and soft computing. pp. 395- 403 ,(2012) , 10.1007/978-3-642-29350-4_48
Tatiana Shpeisman, David Wonnacott, William Pugh, Vadim Maslov, Wayne Kelly, Evan Rosser, The Omega Library interface guide University of Maryland at College Park. ,(1995)
John R. Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependence-based Approach ,(2001)
Dan I. Moldovan, Parallel Processing from Applications to Systems ,(1993)
William Pugh, David Wonnacott, An Exact Method for Analysis of Value-based Array Data Dependences languages and compilers for parallel computing. pp. 546- 566 ,(1993) , 10.1007/3-540-57659-2_31
Bielecki Wlodzimierz, Klimek Tomasz, Palkowski Marek, Anna Beletska, An iterative algorithm of computing the transitive closure of a union of parameterized affine integer tuple relations conference on combinatorial optimization and applications. pp. 104- 113 ,(2010) , 10.1007/978-3-642-17458-2_10
Amy W. Lim, Gerald I. Cheong, Monica S. Lam, An affine partitioning algorithm to maximize parallelism and minimize communication international conference on supercomputing. pp. 228- 237 ,(1999) , 10.1145/305138.305197
Paul Feautrier, Some efficient solutions to the affine scheduling problem: I. One-dimensional time International Journal of Parallel Programming. ,vol. 21, pp. 313- 348 ,(1992) , 10.1007/BF01407835
Artificial Intelligence and Soft Computing Lecture Notes in Computer Science. ,vol. 6113, ,(2010) , 10.1007/978-3-642-13208-7
Chirag Dave, Hansang Bae, Seung-Jai Min, Seyong Lee, Rudolf Eigenmann, Samuel Midkiff, Cetus: A Source-to-Source Compiler Infrastructure for Multicores IEEE Computer. ,vol. 42, pp. 36- 42 ,(2009) , 10.1109/MC.2009.385