A calculus for dense array distributions

Parallel Processing Letters

Volumn 13, Issue 3, 2003, Pages 377-388

  Di Cosmo, Roberto ^a,c   Pelagatti, Susanna ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF PISA   (Italy)

^c INRIA ROCQUENCOURT   (France)

Author keywords

Collective operations; Data partition replication; Performance models; Skeletons

Indexed keywords

DATA PARTITION; DATA REPLICATION;

ARRAYS; DATA REDUCTION; DATA TRANSFER; MATRIX ALGEBRA; PROBLEM SOLVING; PROGRAM PROCESSORS;

PARALLEL PROCESSING SYSTEMS;

EID: 0346897773     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626403001355     Document Type: Review

References (15)

1. M. Aldinucci, et al. Towards parallel programming by transformation: The FAN skeleton framework. Parallel Algorithms & Applications, 16(2-3):87-121, Mar. 2001.
2. D.F. Bacon, S.L. Graham, and O.J. Sharp. Compiler transformations for high-performance computing. ACM Computing Surveys, 26(4):354-420, Dec. 1994.
3. R.S. Bird Lectures in constructive functional programming. In Constructive Methods in Computer Science, NATO ASI F-55, pp. 151-216, Springer-Verlag, 1989.
4. M. Chen, Y. Choo, and J. Li. Crystal: Theory and pragmatics of generating efficient parallel code. In Parallel Functional Languages and Compilers, pp. 255-308. 1991.
5. M. Danelutto, R. Di Cosmo, X. Leroy, and S. Pelagatti. Parallel functional programming with skeletons: the Ocamlp31 experiment. The ML Workshop, 1998.
6. P. Feautrier. Automatic parallelization in the polytope model. In The Data Parallel Programming Model, LNCS 1132, pp. 79-103. Springer-Verlag:Berlin, 1996.
7. S.J. Fink, S.R. Kohn, and S.B. Baden. Efficient run-time support for irregular block-structured applications. J. Parallel and Distributed Computing, 50(1-2):61-8, 1998.
8. J.M.D. Hill, S.R. Donaldson, and D.B. Skillicorn. Stability of communication performance in practice: from to Cray T3E to networks of workstations. Tech. Report PRG-TR-33-97, Oxford University Computing Laboratory, Oct. 1997.
9. R. Lechtchinsky, M. Chackravarty, and G. Keller. Costing nested array codes. Parallel Processing Letters, 12(2):249-266, 2002.
10. P. D. Mosses. Handbook of theoretical computer science, volume B, chapter Denotational Semantics. MIT Press, Cambdridge, MA, 1991.
11. J. Reed et al. Portability, predictability and performance for parallel computing: BSP in practice. Concurrency: Practice & Experience, 8(10):799-812, Dec. 1996.
12. D. B. Skillicorn, J. M. D. Hill, and W. F. McColl. Questions and answers about BSP. Scientific Programming, 6(3):249-274, 1997.
13. M. Südholt. Data distribution algebras: a formal basis for programming using skeletons. In E.-R. Olderog, editor, PROCOMET'94, pages 19-38. North-Holland, June 1994.
14. E. Violard, S. Genaud, and G.-R. Perrin. Refinement of data-parallel programs in PEI. In IFIP Working Conference on Algorithmic Language and Calculi. Feb. 1997.
15. H. Xi and F. Pfenning. Dependent types in practical programming. In Conference Record of POPL 99, pages 214-227, New York, NY, 1999.