Summary
Reducing time of application execution is significant for the quality of image processing and communication systems. Automatic coarse-grained parallelization of program loops is of a great importance for multi-core computing. This paper presents Iteration Space Slicing algorithms aimed at extracting coarse grained parallelism available in arbitrarily nested parameterized loops. We demonstrate that Iteration Space Slicing permits us to generate parallel code for image analysis, encoding and communication solutions. Experimental results are carried out with UTDSP benchmark.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Peng, S.H.: UTDSP: A VLIW Programmable DSP Processor. Department of Electrical and Computer Engineering, Thesis, University of Toronto (1999)
UTDSP benchmark suite, http://www.eecg.toronto.edu/~corinna/DSP/infrastructure/UTDSP.html
Pugh, W., Rosser, E.: Iteration space slicing and its application to communication optimization. In: International Conference on Supercomputing, pp. 221–228 (1997)
Weiser, M.: Program slicing. IEEE Transactions on Software Engineering, 352–357 (1984)
Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: The Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Springer, Heidelberg (1993)
Beletska, A., Bielecki, W., San Pietro, P.: Extracting coarse-grained parallelism in program loops with the slicing framework. In: ISPDC 2007 Proceedings of the Sixth International Symposium on Parallel and Distributed Computing, vol. 29, IEEE Computer Society, Washington (2007)
Bielecki, W., Beletska, A., Palkowski, M., San Pietro, P.: Extracting synchronization-free trees composed of non-uniform loop operations. In: Bourgeois, A.G., Zheng, S.Q. (eds.) ICA3PP 2008. LNCS, vol. 5022, pp. 185–195. Springer, Heidelberg (2008)
Bielecki, W., Palkowski, M.: Using message passing for developing coarse-grained applications in OpenMP. In: Proceedings of Intenrational Conference on Software and Data Technologies ICSOFT 2008 (2008)
OpenMP API, http://www.openmp.org
Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The omega library interface guide. Technical report, College Park, MD, USA (1995)
Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: The Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bielecki, W., Palkowski, M. (2010). Coarse-Grained Loop Parallelization for Image Processing and Communication Applications. In: Choraś, R.S. (eds) Image Processing and Communications Challenges 2. Advances in Intelligent and Soft Computing, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16295-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-16295-4_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16294-7
Online ISBN: 978-3-642-16295-4
eBook Packages: EngineeringEngineering (R0)