Advertisement

Coarse-Grained Loop Parallelization for Image Processing and Communication Applications

  • Włodzimierz Bielecki
  • Marek Palkowski
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 84)

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.

Keywords

Finite Impulse Response Model Architecture Iteration Space Parallel Code Input List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Peng, S.H.: UTDSP: A VLIW Programmable DSP Processor. Department of Electrical and Computer Engineering, Thesis, University of Toronto (1999)Google Scholar
  2. 2.
  3. 3.
    Pugh, W., Rosser, E.: Iteration space slicing and its application to communication optimization. In: International Conference on Supercomputing, pp. 221–228 (1997)Google Scholar
  4. 4.
    Weiser, M.: Program slicing. IEEE Transactions on Software Engineering, 352–357 (1984)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
  10. 10.
    Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The omega library interface guide. Technical report, College Park, MD, USA (1995)Google Scholar
  11. 11.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Włodzimierz Bielecki
    • 1
  • Marek Palkowski
    • 1
  1. 1.Faculty of Computer ScienceTechnical University of SzczecinSzczecinPoland

Personalised recommendations