Loop Nest Tiling for Image Processing and Communication Applications
作者： Wlodzimierz Bielecki , Marek Palkowski
DOI: 10.1007/978-3-319-48429-7_28
关键词:
摘要: Loop nest tiling is one of the most important loop optimizations. This paper presents a practical framework for automatic affine nests to reduce time application execution which crucial quality image processing and communication systems. Our derived via combination Polyhedral Iteration Space Slicing models uses transitive closure dependence graphs. To describe implement approach in source-to-source TRACO compiler, dependences are presented form tuple relations. We expose applicability generate tiled code analysis, encoding program from UTDSP Benchmark Suite. Experimental results demonstrate speed-up optimized programs generated by means implemented TRACO.
springer.com
sci-hub.st 参考文章(24)
Marek Palkowski, Impact of Variable Privatization on Extracting Synchronization-Free Slices for Multi-core Computers Facing the Multicore-Challenge. pp. 72- 83 ,(2013) , 10.1007/978-3-642-35893-7_7
Włodzimierz Bielecki, Marek Palkowski, Coarse-Grained Loop Parallelization for Image Processing and Communication Applications IP&C. pp. 307- 314 ,(2010) , 10.1007/978-3-642-16295-4_35
Wlodzimierz Bielecki, Marek Palkowski, Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph Applied Categorical Structures. pp. 309- 320 ,(2015) , 10.1007/978-3-319-15147-2_26
Tobias Grosser, Sven Verdoolaege, Albert Cohen, Polyhedral AST Generation Is More Than Scanning Polyhedra ACM Transactions on Programming Languages and Systems. ,vol. 37, pp. 12- ,(2015) , 10.1145/2743016
Tatiana Shpeisman, David Wonnacott, William Pugh, Vadim Maslov, Wayne Kelly, Evan Rosser, The Omega Library interface guide University of Maryland at College Park. ,(1995)
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
Mohamed-Walid Benabderrahmane, Louis-Noël Pouchet, Albert Cohen, Cédric Bastoul, The polyhedral model is more widely applicable than you think compiler construction. pp. 283- 303 ,(2010) , 10.1007/978-3-642-11970-5_16
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
Che-Wei Chang, Jian-Jia Chen, Tei-Wei Kuo, H. Falk, Real-time partitioned scheduling on multi-core systems with local and global memories asia and south pacific design automation conference. pp. 467- 472 ,(2013) , 10.1109/ASPDAC.2013.6509640