A library of constructive skeletons for sequential style of parallel programming

ACM International Conference Proceeding Series

Volumn 152, Issue , 2006, Pages

  Matsuzaki, Kiminori ^a   Iwasaki, Hideya ^b   Emoto, Kento ^a   Hu, Zhenjiang ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTIVE SKELETONS; LIBRARY FUNCTIONS; PARALLEL PROGRAMMING LIBRARIES; SEQUENTIAL PROGRAMMERS;

COMPUTATION THEORY; DIGITAL LIBRARIES; FUNCTION EVALUATION; PERSONAL COMPUTERS; SEQUENTIAL MACHINES;

PARALLEL PROGRAMMING;

EID: 34547271043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146847.1146860     Document Type: Conference Paper

References (51)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrik, and T. Przytyoka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10(2):287-302, June 1989.
2. [21 B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti, and M. Vanneschi. P3L: A structured high level programming language and its structured support. Concurrency Practice and Experience, 7(3):225-255, 1995.
3. R. Backhouse. An exploration of the Bird-Meertens formalism. In STOP Summer School on Constructive Algorithmics, Ameland, September 1989.
4. J.-P. Banâtre and D. L. Métayer, editors. Research Directions in High-Level Parallel Programming Languages, Mont Saint-Michel, France, June 17-19, 1991, Proceedings, volume 574 of Lecture Notes in Computer Science. Springer, 1992.
5. A. Benoit and M. Cole. Two fundamental concepts in skeletal parallel programming. In International Conference on Computational Science (2), volume 3515 of Lecture Notes in Computer Science, pages 764 771. Springer-Verlag, 2005.
6. A. Benoit, M. Cole, J. Ilillston, and S. Gilmore. Flexible skeletal programming with eSkel. In Proc. 11th International Euro-Par Conference (Euro-Par2005). volume 3648 of Lecture Notes in Computer Science, pages 761-770. Springer-Verlag, 2005.
7. R. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 5-42. Springer-Verlag, 1987.
8. R. Bird. Constructive functional programming. In STOP Summer School on Constructive Algorithmics, Abeland, 9 1989.
9. R. Bird. Introduction to Functional Programming using Haskell. Prentice Hall, 1998.
10. R. Bird and O. de Moor. Algebras of Programming. Prentice Hall, 1996.
11. R. S. Bird. Lectures on constructive functional programming. Technical Report Technical Monograph PRG-69, Oxford University Computing Laboratory, 1988.
12. H. Bischof, S. Gorlatch, and R. Leshchinskiy. Dattel: A data-parallel C++ template library. Parallel Processing Letters, 13(3):461 472, 2003.
13. G. E. Blelloch. Scans as primitive operations. IEEE Trans. on Computers, 38(11):1526-1538, November 1989.
14. G. H. Botorog and H. Kuchen. Skil: An imperative language with algorithmic skeletons. In Proc. 5th International Symposium on High Performance Distributed Computing (HDPC'96). pages 243-252, 1996.
15. G. H. Botorog and H. Kuchen. Efficient high-level parallel programming. Theoretical Computer Science, 196(1 2):71 107, 1998.
16. S. Chiba. A metaobject protocol for C-. In ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSL4'95), SIGPLAN Notices 30(10), pages 285-299, Austin, Texas, USA, October 1995.
17. M. Cole. Algorithmic skeletons : a structured approach to the management of parallel computation. Research Monographs in Parallel and Distributed Computing, Pitman, London, 1989.
18. M. Cole. Parallel programming, list homomorphisms and the maximum segment sum problems. Report CSR-25-93, Department of Computing Science, The University of Edinburgh, May 1993.
19. M. Cole. Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming. Parallel Computing, 30(3):389-406, 2004.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
21. M. Danelutto, F. Pasqualetti, and S. Pelagatti. Skeletons for data parallelism in P3L. InPrac. 3rd International Euro-Par Conference (Euro-Par '97), volume 1300 of.Lecture Notes in Computer Science, pages 619-628. Springer-Verlag, 1997.
22. .T. Darlington, A. J. Field, P. G. Harrison, P. H. J. Kelly, D. W. N. Sharp, Q. Wu, and R. L. While. Parallel programming using skeleton functions. In Proc. of the Conference on Parallel Architectures and Reduction Languages Europe (PARLE'93), volume 694 of Lecture Notes in Computer Science, pages 146-160. Springer-Verlag, 1993.
23. J. Darlington, Y. Guo, H. To, and J. Yang. Parallel skeletons for structured composition. InProc. 5th ACMSIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'95, pages 19-28, Santa Barbara, California, 1995.
24. O. de Moor. Categories, relations and dynamic programming. Ph.D thesis, Programming research group, Oxford Univ., 1992. Technical Monograph PRG-98.
25. K. Emoto, Z. Hu, K. Kakehi, and M. Takeichi. A compositional framework for developing parallel programs on two dimensional arrays. Technical Report METR2005-09, Department of Mathematical Informatics, University of Tokyo, 2005.
26. M. Fokkinga. A gentle introduction to category theory - the calculational approach -. Technical Report Lecture Notes, Dept. INF. University of Twente, The Netherlands, September 1992.
27. J. D. Frens and D. S. Wise. QR factorization with mortonordcrcd quadtree matrices for memory re-use and parallelism. In Proc. 2003 ACM Symp. on Principles and Practice of Parallel Programming, pages 144-154, 2003.
28. A. Gill, J. Launchbury, and S. P. Jones. A short cut to deforestation. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 223-232, Copenhagen, June 1993.
29. S. Gorlatch. Constructing list homomorphisms. Technical Report MIP-9512, Fakultät für Mathematik und Informatik, Universität Passau, August 1995.
30. S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Bouge. P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Euro-Par '96. Parallel Processing, volume 1124 of Lecture Notes in Computer Science, pages 401-408. Springer-Verlag, 1996.
31. S. Gorlatch, C. Wedler, and C. Lengauer. Optimization rules for programming with collective operations. In M. Atallah, editor, IPPS/SPDP '99. 13th Int. Parallel Processing Symp. & 10th Symp. on Parallel and Distributed Processing, pages 492-499, 1999.
32. Z. Hu, H. Iwasaki, and M. Takeichi. Formal derivation of efficient parallel programs by construction of list homomorphisms. ACM Transactions on Programming Languages and Systems, 19(3):444-461, 1997.
33. Z. Hu. H. Iwasaki, and M. Takeichi. An accumulative parallel skeleton for all. In list European Symposium on Programming (ESOP 2002), volume 2305 of Lecture Notes in Computer Science, pages 83 97, Grenoble, France, April 2002. Springer.
34. Z. Hu, M. Takeichi, and W. Chin. Parallelization in calculational forms. In 25th ACM Symposium on Principles of Programming Languages, pages 316-328, San Diego, California, USA, January 1998.
35. H. Iwasaki and Z. Hu. A new parallel skeleton for general accumulative computations. International Journal of Parallel Programming, 32(5):389-414, October 2004.
36. J. Jeuring. Incremental data compression - extended abstract. In P. Fisher, editor, Proceedings of the Navy Environmental Systems Workshop, 1992.
37. J. Jeuring. Theories for Algorithm Calculation. Ph.D thesis, Faculty of Science, Utrecht University, 1993.
38. E. Johnson and D. Gannon. HPC++: Experiments with the parallel standard template library. In Proc. 1997 International Conference on Supercomputing (ICS '97), pages 124 131, 1997.
39. H. Kuchen. A skeleton library. In Proc. 8th International Euro-Par Conference (Euro-Par2002), volume 2400 of Lecture Notes in Computer Science, pages 620-629. Springer-Verlag, 2002.
40. K. Matsuzaki, Z. Hu, and M. Takeichi. Design and implementation of general tree skeletons. Technical Report METR2005-30, Department of Mathematical Engineering and Information Physics, University of Tokyo, 2005.
41. K. Matsuzaki, K. Kakehi, H. Iwasaki, Z. Hu, and Y. Akashi. A fusion-embedded skeleton library. In IOth International Euro-Par Conference (EuroPar 2004), volume 3149 of Lecture Notes in Computer Science, pages 644-653. Springer. August 2004.
42. E. W. Mayr and R. Werchner. Optimal tree contraction and term matching on the hypercube and related networks. Algarithmica, 18(3):445 460, 1997.
43. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In Proc. Conference on Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, pages 124-144, Cambridge, Massachuetts, August 1991.
44. G. Miller and .T. Reif. Parallel tree contraction and its application. In 6th Annual IEEE Syrup. on the Foundations of Camp. Science, pages 478-489, 1985.
45. S.-C. Mu and R. Bird. Theory and applications of inverting functions as folds. Sci. Comput. Program., 51(1-2):87-116, 2004.
46. F. Rabhi and S.G. (eds). Patterns and Skeletons for Parallel and Distributed Computing. Springer Verlag, 2002.
47. M. Reid-Miller, G. L. Miller, and F. Modugno. List ranking and parallel tree contraction. In J. H. Reif, editor, Synthesis of Parallel Algorithms, chapter 3, pages 115-194. Morgan Kaufmann Publishers, 1996.
48. I. Sasano, Z. Hu, M. Takeichi, and M. Ogawa. Make it practical: A generic linear time algorithm for solving maximum weightsum problems. In The 2000 ACM SIGPIAN International Conference on Functional Programming (ICh'P 2000), pages 137-149, Montreal. Canada. September 2000. ACM Press.
49. D. Skillicorn. Foundations of Parallel Programming. Cambridge University Press, 1994.
50. K. Tan, D. Szafron, J. Schaeffer, J. Anvik, and S. MacDonald. Using generative design patterns to generate parallel code for a distributed memory environment. In PPoPP '03: Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 203-215, New York, NY, USA, 2003. ACM Press.
51. D. S. Wise. Representing matrices as quadtrees for parallel processors. Information Processing Letters, 20(4): 195-199, 1984.