Costing nested array codes

Parallel Processing Letters

Volumn 12, Issue 2, 2002, Pages 249-266

  Lechtchinsky, Roman ^a   Chakravarty, Manuel M T ^b   Keller, Gabriele ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Cost calculus; Flattening; Functional programming; Nested data parallelism; Program transformation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; RECURSIVE FUNCTIONS;

PROGRAM TRANSFORMATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0036625436     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0129626402000951     Document Type: Conference Paper

References (18)

1. G. Blelloch, H. Burch, K. Crary, R. Harper, G. Miller, and N. Walkington. Persistent triangulations. Journal of Functional Programming, 11(5), 2001.
2. G.E. Blelloch. Vector Models for Data-Parallel Computing. The MIT Press, 1990.
3. G.E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3):85-97, 1996.
4. G.E. Blelloch and J. Greiner. A provable time and space efficient implementation of NESL. In International Conference on Functional Programming, pages 213-225, 1996.
5. D. Cann. Retire fortran? A debate rekindled. Communications of the ACM, 35(8):81, Aug. 1992.
6. M.M.T. Chakravarty and G. Keller. More types for nested data parallel programming. In P. Wadler, editor, Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 94-105. ACM Press, 2000.
7. M.M.T. Chakravarty, G. Keller, R. Lechtchinsky, and W. Pfannenstiel. Nepal-nested data parallelism in Haskell. In R. Sakellariou, J. Keane, J.R. Gurd, and L. Freeman, editors, Euro-Par 2001: Parallel Processing, 7th International Euro-Par Conference, pages 524-534, Berlin, Germany, 2001. Springer-Verlag.
8. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 130-141. ACM Press, 1995.
9. R. Hinze. A new approach to generic functional programming. In Proceedings of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM Press, 2000.
10. G. Hutton. A tutorial on the universality and expressiveness of fold. Journal of Functional Programming, 9(4):355-372, 1999.
11. C. Jay, M. Cole, M. Sekanina, and P. Steckler. A monadic calculus for parallel costing of a functional language of arrays. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, Euro-Par'97 Parallel Processing, volume 1300 of LNCS, pages 650-661. Springer-Verlag, 1997.
12. C.B. Jay. Costing parallel programs as a function of shapes. Science of Computer Programming, 37:207-224, 2000.
13. G. Keller and M.M.T. Chakravarty. On the distributed implementation of aggregate data structures by program transformation. In J. Rolim et al., editors, Parallel and Distributed Processing, Fourth International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'99), number 1586 in Lecture Notes in Computer Science, pages 108-122, Berlin, Germany, 1999. Springer-Verlag.
14. G. Keller and M.M.T. Chakravarty. Functional array fusion. In X. Leroy, editor, Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01). ACM Press, 2001.
15. J. Riely and J. Prins. Flattening is an improvement. In Proceedings of the Seventh Static Analysis Symposium (SAS'2000), LNCS, pages 360-376. Springer-Verlag, 2000.
16. D. Sands. A naïve time analysis and its theory of cost equivalence. Journal of Logic and Computation, 5(4):495-541, 1995.
17. S.-B. Scholz. On defining application-specific high-level array operations by means of shape-invariant programming facilities. In Proceedings of APL'98, pages 40-45. ACM Press, 1998.
18. T. Sheard and L. Fegaras. A fold for all seasons. In Proceedings 6th ACM SIG-PLAN/SIGARCH Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA'93, pages 233-242, New York, 1993. ACM Press.