Skip to main content
SpringerLink
Log in

Optimizing Sequences of Skeleton Calls

  • Chapter
Book cover Domain-Specific Program Generation

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3016))

Abstract

Today, parallel programming is dominated by message passing libraries such as MPI. Algorithmic skeletons intend to simplify parallel programming by their expressive power. The idea is to offer typical parallel programming patterns as polymorphic higher-order functions which are efficiently implemented in parallel. Skeletons can be understood as a domain-specific language for parallel programming. In this chapter, we describe a set of data parallel skeletons in detail and investigate the potential of optimizing sequences of these skeletons by replacing them by more efficient sequences. Experimental results based on a draft implementation of our skeleton library are shown.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bischof, H., Gorlatch, S.: Double-Scan: Introducing and Implementing a New Data-Parallel Skeleton. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 640–647. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Bird, R.: Lectures on Constructive Functional Programming. In: Broy, M. (ed.) Constructive Methods in Computing Science. NATO ASI Series, pp. 151–216. Springer, Heidelberg (1988)

    Google Scholar 

  3. Bird, R.: Algebraic identities for program calculation. The Computer Journal 32(2), 122–126 (1989)

    Article  MathSciNet  Google Scholar 

  4. Botorog, G.H., Kuchen, H.: Efficient Parallel Programming with Algorithmic Skeletons. In: Fraigniaud, P., Mignotte, A., Bougé, L., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1123, pp. 718–731. Springer, Heidelberg (1996)

    Google Scholar 

  5. Botorog, G.H., Kuchen, H.: Efficient High-Level Parallel Programming. Theoretical Computer Science 196, 71–107 (1998)

    Article  MATH  Google Scholar 

  6. Cole, M.: Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press, Cambridge (1989)

    MATH  Google Scholar 

  7. Darlington, J., Field, A.J., Harrison, T.G., et al.: Parallel Programming Using Skeleton Functions. In: Reeve, M., Bode, A., Wolf, G. (eds.) PARLE 1993. LNCS, vol. 694, pp. 146–160. Springer, Heidelberg (1993)

    Google Scholar 

  8. Darlington, J., Guo, Y., To, H.W., Yang, J.: Functional Skeletons for Parallel Coordination. In: Haridi, S., Ali, K., Magnusson, P. (eds.) Euro-Par 1995. LNCS, vol. 966, pp. 55–66. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  9. Danelutto, M., Pasqualetti, F., Pelagatti, S.: Skeletons for Data Parallelism in p3l. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Euro-Par 1997. LNCS, vol. 1300, pp. 619–628. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Foster, I., Olson, R., Tuecke, S.: Productive Parallel Programming: The PCN Approach. Scientific Programming 1(1), 51–66 (1992)

    Google Scholar 

  11. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns. Addison-Wesley, Reading (1995)

    Google Scholar 

  12. Gropp, W., Lusk, E., Skjellum, A.: Using MPI. MIT Press, Cambridge (1999)

    Google Scholar 

  13. Gorlatch, S., Lengauer, C. (De)Composition Rules for Parallel Scan and Reduction. In: 3rd Int. Working Conf. on Massively Parallel Programming Models (MPPM 1997), pp. 23–32. IEEE, Los Alamitos (1997)

    Google Scholar 

  14. Gorlatch, S.: Optimizing Compositions of Components in Parallel and Distributed Programming. LNCS, vol. 3016. Springer, Heidelberg (2004)

    Google Scholar 

  15. Gorlatch, S., Wedler, C., Lengauer, C.: Optimization Rules for Programming with Collective Operations. In: 13th Int. Parallel Processing Symp. & 10th Symp. on Parallel and Distributed Processing, pp. 492–499 (1999)

    Google Scholar 

  16. Karmesin, S., et al.: Array Design and Expression Evaluation in POOMA II. In: Caromel, D., Oldehoeft, R.R., Tholburn, M. (eds.) ISCOPE 1998. LNCS, vol. 1505, pp. 231–238. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Kuchen, H., Cole, M.: The Integration of Task and Data Parallel Skeletons. Parallel Processing Letters 12(2), 141–155 (2002)

    Article  Google Scholar 

  18. Koelbl, C.H., et al.: The High Performance Fortran Handbook. Scientific and Engineering Computation. MIT Press, Cambridge (1994)

    Google Scholar 

  19. Kuchen, H., Plasmeijer, R., Stoltze, H.: Efficient Distributed Memory Implementation of a Data Parallel Functional Language. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 466–475. Springer, Heidelberg (1994)

    Google Scholar 

  20. Kuchen, H., Striegnitz, J.: Higher-Order Functions and Partial Applications for a C++ Skeleton Library. In: Joint ACM Java Grande & ISCOPE Conference, pp. 122–130. ACM, New York (2002)

    Chapter  Google Scholar 

  21. Kuchen, H.: A Skeleton Library. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 620–629. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Kuchen, H.: The Skeleton Library Web Pages, http://danae.uni-muenster.de/lehre/kuchen/Skeletons/

  23. Lengauer, C.: Program Optimization in the Domain of High-Performance Parallelism. In: Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds.) Domain-Specific Program Generation. LNCS, vol. 3016, pp. 73–91. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  24. McColl, W.: Scalable Computing. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 46–61. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  25. McNamara, B., Smaragdakis, Y.: Functional Programming in C++. In: ICFP 2000, pp. 118–129. ACM, New York (2000)

    Chapter  Google Scholar 

  26. Skillicorn, D.B., Danelutto, M., Pelagatti, S., Zavanella, A.: Optimising Data-Parallel Programs Using the BSP Cost Model. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol. 1470, pp. 698–703. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  27. Skillicorn, D., Hill, J.M.D., McColl, W.: Questions and Answers about BSP. Scientific Programming 6(3), 249–274 (1997)

    Google Scholar 

  28. Skillicorn, D.: Foundations of Parallel Programming. Cambridge U. Press, Cambridge (1994)

    Book  Google Scholar 

  29. Smaragdakis, Y.: A Personal Outlook on Generator Research. In: Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds.) Domain-Specific Program Generation. LNCS, vol. 3016, pp. 92–106. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  30. Striegnitz, J.: Making C++ Ready for Algorithmic Skeletons. Tech. Report IB-2000-08, http://www.fz-juelich.de/zam/docs/autoren/striegnitz.html

  31. Zima, H.P., Chapman, B.M.: Supercompilers for Parallel and Vector Computers. ACM Press/Addison-Wesley (1990)

    Google Scholar 

  32. ZIV-Cluster, http://zivcluster.uni-muenster.de/

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, University of Münster, Leonardo Campus 3, D-48159, Münster, Germany

    Herbert Kuchen

Authors
  1. Herbert Kuchen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Mathematics, University of Passau,  

    Christian Lengauer

  2. University of Texas at Austin, Austin, Texas, USA

    Don Batory

  3. INRIA/LaBRI, Domaine universitaire, 351, cours de la Libération, F-33402, Talence Cedex

    Charles Consel

  4. EPFL, 1015, Lausanne, Switzerland

    Martin Odersky

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kuchen, H. (2004). Optimizing Sequences of Skeleton Calls. In: Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds) Domain-Specific Program Generation. Lecture Notes in Computer Science, vol 3016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25935-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25935-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22119-7

  • Online ISBN: 978-3-540-25935-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation