Task parallel skeletons for irregularly structured problems

  • Petra Hofstedt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)


The integration of a task parallel skeleton into a functional programming language is presented. Task parallel skeletons, as other algorithmic skeletons, represent general parallelization patterns. They are introduced into otherwise sequential languages to enable the development of parallel applications. Into functional programming languages, they naturally are integrated as higher-order functional forms.

We show by means of the example branch-and-bound that the introduction of task parallel skeletons into a functional programming language is advantageous with regard to the comfort of programming, achieving good computation performance at the same time.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Botorog, G.H., Kuchen, H.: Efficient Parallel Programming with Algorithmic Skeletons. In: Boug, L. (Ed.): Proceedings of Euro-Par’96, Vol.1. LNCS 1123. 1996.Google Scholar
  2. 2.
    de Bruin, A., Kindvater, G.A.P., Trienekens, H.W.J.M.: Asynchronous Parallel Branch and Bound and Anomalies. In: Ferreira, A.: Parallel algorithms for irregularly structured problems. Irregular ’95. LNCS 980. 1995.Google Scholar
  3. 3.
    Cole, M.: Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press. 1989.Google Scholar
  4. 4.
    Darlington, J., Field, A.J., Harrison, P.G., Kelly, P.H.J., Sharp, D.W.N., Wu, Q., While, R.L.: Parallel Programming Using Skeleton Functions. In: Bode, A. (Ed.): Parallel Architectures and Languages Europe: 5th International PARLE Conference. LNCS 694. 1993.Google Scholar
  5. 5.
    Darlington, J., Guo, Y., To, H.W., Yang, J.: Functional Skeletons for Parallel Coordination. In: Haridi, S. (Ed.): Proceedings of Euro-Par’95. LNCS 966. 1995.Google Scholar
  6. 6.
    Park, S.-B.: Implementierung einer datenparallelen funktionalen Programmiersprache auf einem Transputersystem. Diplomarbeit. RWTH Aachen 1995.Google Scholar
  7. 7.
    Trienekens, H.W.J.M.: Parallel Branch and Bound Algorithms. Dissertation. Universität Rotterdam 1990.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Petra Hofstedt
    • 1
  1. 1.Department of Computer ScienceDresden University of TechnologyGermany

Personalised recommendations