Abstract
We present a skeleton-based language which leads to portable and cost-predictable implementations on MIMD computers. The compilation process is described as a series of program transformations. We focus in this paper on the step concerning the distribution choice. The problem of automatic mapping of input vectors onto processors is addressed using symbolic cost evaluation. Source language restrictions are crucial since they permit to use powerful techniques on polytope volume computations to evaluate costs precisely. The approach can be seen as a cross-fertilization between techniques developed within the FORTRAN parallelization and skeleton communities.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. In 4th ACM Symp. on Princ. and Practice of Parallel Prog., pages 102–112. 1993.
T. Bratvold. A Skeleton-Based Parallelising Compiler for ML. In 5th Int. Workshop on the Imp. of Fun. Lang., pages 23–33, 1993.
S. Chatterjee, J. R. Gilbert, R. Schreiber, and S. Teng. Automatic array alignment in data-parallel program. In 20th ACM Symp. on Princ. of Prog. Lang., pages 16–28, 1993.
J. Choi and J. J. Dongarra. Scalable linear algebra software libraries for distributed memory concurrent computers. In Proc. of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems, pages 170–177, 1995.
P. Clauss. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. In ACM Int. Conf. on Supercomputing, 1996.
M. Cole. A skeletal approach to the exploitation of parallelism. In CONPAR’88, pages 667–675. Cambridge University Press, 1988.
J. Darlington, A. J. Field, P. G. Harrison, P. H. J. Kelly, D. W. N. Sharp, Q. Wu, and R. L. While. Parallel programming vising skeleton functions. In PARLE ’93, pages 146–160. LNCS 694, 1993.
J. Darlington, Y. K Guo, H. W. To, and Y. Jing. Skeletons for structured parallel composition. In 5th ACM Symp. on Princ. and Practice of Parallel Prog., pages 19–28, 1995.
S. Gorlatch and C. Lengauer. (De)Composition rules for parallel scan and reduction. In 3rd IEEE Int. Conf. on Massively Par. Prog. Models, 1998.
M. Gupta and P. Banerjee. Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 3(2):179–193, 1992.
C. B. Jay, M. I. Cole, M. Sekanina, and P. Steckler. A monadic calculus for parallel costing of a functional language of arrays. In Euro-Par’97 Parallel Processing, pages 650–661. LNCS 1300, 1997.
J. Mallet. Compilation for MIMD computers of a skeleton-based language through symbolic cost analysis and automatic data distribution. Technical Report 1190, IRISA, May 1998.
S. Pelagatti. A Methodology for the Development and the Support of Massively Parallel Programs. PhD thesis, Pise University, 1993.
R. Rangaswami. A Cost Analysis for a Higher-order Parallel Programming Model. PhD thesis, Edinburgh University, 1996.
D. B. Skillicorn and W. Cai. A cost calculus for parallel functional programming. Technical report, Queen’s University, 1993.
N. Tawbi. Estimation of nested loops execution time by integer arithmetic in convex polyhedra. In Int. Symp. on Par. Proc., pages 217–223, 1994.
P. Wadler. Linear types can change the world! In Programming Concepts and Methods, pages 561–581. North Holland, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mallet, J. (1998). Symbolic cost analysis and automatic data distribution for a skeleton-based language. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057917
Download citation
DOI: https://doi.org/10.1007/BFb0057917
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive