A calculus for parallel computations over multidimensional dense arrays

Computer Languages, Systems and Structures

Volumn 33, Issue 3-4, 2007, Pages 82-110

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

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Collective operations; Data parallel; Formal methods; Performance models; Skeletons

Indexed keywords

COMPUTATIONAL METHODS; DATA ACQUISITION; DISTRIBUTED DATABASE SYSTEMS; FORMAL METHODS; PROGRAM PROCESSORS; SEMANTICS;

DATA COLLECTION; MULTIDIMENSIONAL DENSE ARRAYS; SKELETONS;

PARALLEL PROCESSING SYSTEMS;

EID: 33847617932     PISSN: 14778424     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cl.2006.07.005     Document Type: Article

References (28)

1. Choi J., Dongarra J., Pozo R., and Walker D. ScaLAPACK: a scalable linear algebra library for distributed memory concurrent computers. Proceedings of the fourth symposium on the frontiers of massively parallel computation, McLean, Virginia (1992), IEEE Computer Society Press, Silver Spring, MD 120-127
2. Casanova H, Dongarra J. Netsolve: a network server for solving computational science problems. Technical report, University of Tennessee; 1996.
3. Sekiguchi S., Sato M., Nakada H., Matsuoka S., and Nagashima U. Ninf: network based information library for globally high performance computing. Proceedings of parallel object-oriented methods and applications (POOMA), Santa Fe (1996)
4. Danelutto M, Pasqualetti F, Pelagatti S. Skeletons for data parallelism in P3L. In: Proceedings of EURO-PAR '97, Passau, Germany. Lecture notes in computer science, vol. 1300. Berlin: Springer; 1977. p. 619-28.
5. Danelutto M, Di Cosmo Ri, Leroy X, Pelagatti S. Parallel functional programming with skeletons: the OcamlP3l experiment, The ML workshop, Baltimore, 1998.
6. Quinn M. Parallel computing: theory and practice (1994), McGraw-Hill, New York
7. Di Cosmo R., and Pelagatti S. A calculus for dense array distributions. Parallel Processing Letters 13 (2003) 377-388
8. Xi H., and Pfenning F. Dependent types in practical programming. Conference record of POPL 99. the 26th ACM SIGPLAN-SIGACT symposium on principles of programming languages, San Antonio, Texas, New York, NY (1999) 214-227
9. Bird R. Lectures in constructive functional programming. In: Constructive methods in computer science. NATO ASI, vol. F-55. Berlin: Springer; 1989. p. 151-216.
10. Gorlatch S., Wedler C., and Lengauer C. Optimization rules for programming with collective operations. 13th international parallel processing symposium and 10th symposium on parallel and distributed processing (IPPS/SPDP'99) (1999) 492-499
11. Mosses PD. Handbook of theoretical computer science, vol. B. Cambridge, MA: MIT Press; 1991. [Denotational semantics].
12. Li Z. Efficient implementation of map skeleton for the OcamlP3l system. DEA report, Université PARIS VII; July 2003.
13. Skillicorn D.B., Hill J.M.D., and McColl W.F. Questions and answers about bsp. Scientific Programming 6 3 (1997) 249-274
14. Reed J., Parrot K., and Lanfear T. Portability, predictability and performance for parallel computing: BSP in practice. Concurrency: Practice and Experience 8 10 (1996) 799-812
15. Hill J, Donaldson S, Skillicorn D. Stability of communication performance in practice: from to cray t3e to networks of workstations. Technical Report PRG-TR-33-97, Oxford University Computing Laboratory; October 1997.
16. Hill JMD. Collective communications in the Oxford BSP toolset, note, part of the bsplib documentation; 1997.
17. Roda J., Rodríguez C., Morales D., and Almeida F. Predicting the execution time of message passing models. Concurrency: Practice and Experience 11 9 (1999) 461-477
18. Rodríguez C., Roda J., Sande F., Morales D., and Almeida F. A new parallel model for the analysis of asynchronous algorithms. Parallel Computing 26 (2000) 753-767
19. Foster I. Designing and building parallel programs (1995), Addison-Wesley, Reading, MA
20. Bacon D., Graham S., and Sharp O. Compiler transformations for high-performance computing. ACM Computing Surveys 26 4 (1994) 354-420
21. Violard E., Genaud S., and Perrin G.-R. Refinement of data-parallel programs in PEI. In: Bird R., and Meertens L. (Eds). IFIP working conference on algorithmic language and calculi (1997), Chapman & Hall, London
22. Südholt M. Data distribution algebras: a formal basis for programming using skeletons. In: Olderog E.-R. (Ed). Programming concepts, methods and calculi (PROCOMET'94) (1994), North-Holland, Amsterdam 19-38
23. Chen M., Choo Y., and Li J. Crystal: theory and pragmatics of generating efficient parallel code. In: Szymanski B. (Ed). Parallel functional languages and compilers (1991), Frontier Series, ACM Press, New York 255-308 [chapter 7]
24. Lechtchinsky R., Chackravarty M., and Keller G. Costing nested array codes. Parallel Processing Letters 12 2 (2002) 249-266
25. Misra J. Powerlist: a structure for parallel recursion. ACM Transactions on Programming Languages and Systems 16 6 (1994) 1737-1767
26. Jay C, Cole M, Sekanina M, Steckler P. A monadic calculus for parallel costing of a functional language of arrays, in: Lengauer C, Griebl M, Gorlatch S, editors. Proceedings of Euro-Par'97 parallel processing, Lecture notes in computer science, vol. 1300. Berlin: Springer; 1997. p. 650-61.
27. Fink S., Kohn S., and Baden S. Efficient run-time support for irregular block-structured applications. Journal of Parallel and Distributed Computing 50 1-2 (1998) 61-68
28. Feautrier P. Automatic parallelization in the polytope model. In: Perrin G-R, Darte A, editors. The data parallel programming model. Lecture notes in computer science, vol. 1132. Berlin: Springer; 1996. p. 79-103.