Parallel elementwise processable functions in concurrent clean

  • Authors:

  • Z. Horváth;V. Zsók;P. Serrarens;R. Plasmeijer

  • Affiliations:

  • Department of General Computer Science Eötvös Loränd University Pázmány Péter sétány 1/C, H-1117 Budapest, Hungary;Department of General Computer Science Eötvös Loränd University Pázmány Péter sétány 1/C, H-1117 Budapest, Hungary;Faculty of Mathematics and Computer Science University of Nijmegen Toernooiveld 1, 6525 ED Nijmegen, The Netherlands;Faculty of Mathematics and Computer Science University of Nijmegen Toernooiveld 1, 6525 ED Nijmegen, The Netherlands

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.98

Visualization

Abstract

The behaviour of concurrent and parallel programs can be specified in a functional style. Functional programming style has some inherent concurrent features. However, for a higher degree of expressing parallelism there is a need for new language constructs. In this paper, we introduce Concurrent Clean modules for evaluation strategies in order to control the evaluation degree, the dynamic behaviour, and the parallelism. The usage of the strategies will be illustrated by the parallel elementwise processing method. The implementation of the method in the lazy functional programming language Concurrent Clean operates with a two arguments two values elementwise processable function. In order to obtain abstract type specification for the generalised manipulation of the linear data structures like lists, arrays, and strict arrays, a linear data structure class module is defined. The programming style is skeleton based. Skeletons in functional languages are higher-order functions. The skeleton given in this paper represents a generalisation of the map function. It is triply parameterized: by an elementwise processable function, by type specification, and by the strategy parameter that defines the dynamic behaviour of the program.