Abstract
Skeleton-oriented programming is a new technique that aims towards reusability of software components in massively parallel systems. Carefully tested and efficiently implemented coordination schemes and data distributions are collected in a library of algorithmic skeletons. Programmers inspect the library, access the appropriate element and fill in the application-dependent parts. Our approach has several benefits, such as improved portability, reusability, and correctness of software.
After a short introduction, we summarize BACS (Basel Algorithm Classification Scheme) and present a sample algorithm. Next, we introduce TINA, the skeleton generator, and describe the basics of its script input language. We sketch our implementation testbed and report on measurements done in a transputer environment. Finally, we conclude with some remarks on the project state and related work.
This research is funded by the Swiss National Science Foundation, research grant SPP IF 5003-34357: “Skeleton-Oriented Programming”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Helmar Burkhart, Carlos Falco Korn, Stephan Gutzwiller, Peter Ohnacker, and Stephan Waser. BACS: Basel Algorithm Classification Scheme. Technical Report 93-3, Institut für Informatik, University of Basel, Switzerland, March 1993.
Stephan Gutzwiller. Methoden und Werkzeuge des skelettorientierten Programmierens. PhD thesis, University of Basel, to appear 1994 (in german).
K. M. Decker, J. J. Dvorak, and R. M. Rehmann. A Knowledge-Based Scientific Parallel Programming Environment. IFIP Working Conference WG10.3 on Programming Environments for Massively Parallel Distributed Systems, 1994.
Jean-Daniel Pouget. YAPPE — Eine tupelorientierte Programmierumgebung für Parallelrechner. PhD thesis, University of Basel, June 1993 (in german).
Stephan Waser. Benchmarking Parallel Computers. PhD thesis, University of Basel, July 1993.
C. Krueger. Software Reuse. ACM Computing Surveys, 24(2):131–183, 1992.
M. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press, Cambridge, Massachusetts, 1989.
J. Darlington, A. Field, P. Harrison, P. Kelly, D. Sharp, and Q. Wu. Parallel Programming Using Skeleton Functions. Proc. 5th Int Conf PARLE, 146–160, Springer, 1993.
Workshop on Abstract Machine Models for Highly Parallel Computers. Leeds, April 1993, Oxford Univ. Press.
Conference on Massively Parallel Programming Models. Berlin, September 1993.
P. B. Hansen. Model Programs for Computational Science: A Programming Methodology for Multicomputers. Concurrency — Practice and Experience. Jan 1993.
E. Gabber. VMMP: A Practical Tool for the Development of Portable and Efficient Programs for Multiprocessors. IEEE Trans, on Parallel and Distributed Systems, 1(3), July 1990.
G. Alverson and D. Notkin. Program Structuring for Effective Parallel Portability. IEEE Trans, on Parallel and Distributed Systems, Vol 4, No 9, 1041–1059, Sep 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Basel AG
About this paper
Cite this paper
Burkhart, H., Gutzwiller, S. (1994). Steps Towards Reusability and Portability in Parallel Programming. In: Decker, K.M., Rehmann, R.M. (eds) Programming Environments for Massively Parallel Distributed Systems. Monte Verità. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8534-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8534-8_15
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9668-9
Online ISBN: 978-3-0348-8534-8
eBook Packages: Springer Book Archive