Some Experiments in Transforming Towards Parallel Executability
“Transformational Programming” summarizes a methodology for constructing correct and efficient programs from formal specifications by successive application of (provably) meaning-preserving transformation rules. This paper reports on several experiments on using this methodology, which has previously proven to be applicable to the development of sequential algorithms, for the formal derivation of algorithms executable on parallel architectures, notably SIMD machines. Based on the hypothesis that existing transformational knowledge should be sufficient also for deriving parallel algorithms, identifying useful transformation rules and strategic aspects of their use was one of the main goals of these experiments.
KeywordsTransformation Rule Parallel Architecture Sequential Algorithm Single Instruction Multiple Data Operation Symbol
Unable to display preview. Download preview PDF.
- Broy, M.: A case study in program development: sorting. Institut für Informatik, TU München, TUM-INFO-7831 (1978)Google Scholar
- Darlington, J., Field, A.J., Harrison, P.G., Harper, D., Jouret, G.K., Kelly, P.J., Sephton, K.M., Sharp, D.W.: Structured parallel functional programming. Imperial College, London, UK, Technical Report 1991Google Scholar
- Feather, M.S.: A survey and classification of some program transformation approaches and techniques. In: Meertens, L.G.L.T. (ed.): Program specification and transformation. Amsterdam: North-Holland 1987, pp. 165–196Google Scholar
- Goodman, S.E., Hedetniemi, S.T.: Introduction to the design and analysis of algorithms. New York: McGraw-Hill 1977Google Scholar
- Meertens, L.G.L.T.: Constructing a calculus of programs. In: Van de Snepscheut, J.L.A. (ed.): Mathematics of program construction. Lecture Notes in Computer Science 375, Berlin: Springer 1989, pp. 66–90Google Scholar
- Pepper, P.: Deductive derivation of parallel programs. Technische Universität Berlin, Fachbereich Informatik, Technical Report 92-23, 1992. Also: this volumeGoogle Scholar
- Smith, D.R., Lowry, M.: Algorithm theories and design tactics. In: Van de Snepscheut, J.L.A. (ed.): Mathematics of program construction. Lecture Notes in Computer Science 375, Berlin: Springer 1989, pp. 379–398Google Scholar
- Völker, N.: A formal derivation of odd-even transposition sort. KU Nijmegen, Technical Report 1992Google Scholar
- Yang, J.A., Choo, Y.: Design, implementation, and applications of a metalanguage for parallel-program transformations. Dept. of Comp. Sc., Yale University, Technical Report 1990Google Scholar