Parallel skeletons for manipulating general trees

Parallel Computing

Volumn 32, Issue 7-8, 2006, Pages 590-603

  Matsuzaki, Kiminori ^a   Hu, Zhenjiang ^a   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Constructive algorithmics; Rose trees; Skeletal parallelism; Tree skeletons

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SYSTEMS PROGRAMMING; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; XML;

CONSTRUCTIVE ALGORITHMICS; ROSE TREES; SEQUENTIAL PROGRAMMING; SKELETAL PARALLELISM; TREE SKELETONS;

TREES (MATHEMATICS);

EID: 33750371934     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2006.06.002     Document Type: Article

References (37)

1. Cole M. Algorithmic skeletons: a structured approach to the management of parallel computation. Research Monographs in Parallel and Distributed Computing (1989), Pitman, London
2. Rabhi F., and Gorlatch S. Patterns and Skeletons for Parallel and Distributed Computing (2002), Springer-Verlag Inc., New York
3. Blelloch G.E. Scans as primitive operations. IEEE Transactions on Computers 38 11 (1989) 1526-1538
4. Chin W., Takano A., and Hu Z. Parallelization via context preservation. IEEE Computer Society International Conference on Computer Languages (ICCL'98) (1998) 153-162
5. Cole M. Parallel programming with list homomorphisms. Parallel Processing Letters 5 2 (1995) 191-203
6. Gorlatch S. Systematic efficient parallelization of scan and other list homomorphisms. EuroPar '96 Parallel Processing, Second International Euro-Par Conference. Lecture Notes in Computer Science 1124 (1996), Springer-Verlag, LIP, ENS Lyon, France 401-408
7. Iwasaki H., and Hu Z. A new parallel skeleton for general accumulative computations. International Journal of Parallel Programming 32 5 (2004) 389-414
8. Skillicorn D.B. The Bird-Meertens formalism as a parallel model. In: Kowalik J.S., and Grandinetti L. (Eds). NATO ASI Workshop on Software for Parallel Computation. NATO ARW "Software for Parallel Computation" 106 of F (1992), Springer-Verlag NATO ASI, Cetraro, Italy
9. Skillicorn D.B. Foundations of Parallel Programming (1994), Cambridge University Press
10. Matsuzaki K., Hu Z., and Takeichi M. Parallelization with tree skeletons. Proceedings of the Ninth EuroPar Conference (EuroPar 2003). Lecture Notes in Computer Science 2790 (2003), Springer-Verlag, Klagenfurt, Austria 789-798
11. Skillicorn D.B. Parallel implementation of tree skeletons. Journal of Parallel and Distributed Computing 39 2 (1996) 115-125
12. J. Gibbons, Computing downwards accumulations on trees quickly, in: G. Gupta, G. Mohay, R. Topor (Eds.), Proceedings of 16th Australian Computer Science Conference, vol. 15 (1), Australian Computer Science Communications, 1993, pp. 685-691.
13. Gibbons J., Cai W., and Skillicorn D.B. Efficient parallel algorithms for tree accumulations. Science of Computer Programming 23 1 (1994) 1-18
14. K. Matsuzaki, Z. Hu, M. Takeichi, Implementation of parallel tree skeletons on distributed systems, in: Proceedings of the Third Asian Workshop on Programming Languages and Systems, Shanghai, China, 2002, pp. 258-271.
15. H. Deldari, J.R. Davy, P.M. Dew, A skeleton for parallel CSG with a performance model, Tech. Rep., School of Computer Studies Research Report Series, University of Leeds, 1997.
16. L. Meertens, First steps towards the theory of rose trees, CWI, Amsterdam, IFIP Working Group 2.1 Working paper 592 ROM-25, 1988.
17. Bird R.S. An introduction to the theory of lists. In: Broy M. (Ed). Logic of Programming and Calculi of Discrete Design. NATO ASI Series F 36 (1987), Springer-Verlag 5-42
18. Bird R.S., and de Moor O. Algebras of Programming (1996), Prentice Hall
19. J. Jeuring, Theories for algorithm calculation, Ph.D thesis, Faculty of Science, Utrecht University, parts of the thesis appeared in the Lecture Notes of the STOP 1992 Summer school on Constructive Algorithmics (1993).
20. K. Emoto, Z. Hu, K. Kakehi, M. Takeichi, A compositional framework for developing parallel programs on two dimensional arrays, Tech. Rep. METR2005-09, Department of Mathematical Informatics, University of Tokyo, 2005.
21. Bird R. Introduction to Functional Programming using Haskell (1998), Prentice Hall
22. S. Peyton Jones, J. Hughes, Report on the programming language Haskell 98: a non-strict, purely functional language. Available from: (1999).
23. Matsuzaki K., Hu Z., Kakehi K., and Takeichi M. Systematic derivation of tree contraction algorithms. Parallel Processing Letters 15 3 (2005) 321-336
24. Abrahamson K., Dadoun N., Kirkpatrik D.G., and Przytycka T. A simple parallel tree contraction algorithm. Journal of Algorithms 10 2 (1989) 287-302
25. Miller G.L., and Reif J.H. Parallel tree contraction and its application. 26th Annual Symposium on Foundations of Computer Science (1985), IEEE Computer Society Press, Portland, OR 478-489
26. K. Matsuzaki, Z. Hu, M. Takeichi, Design and implementation of general tree skeletons, Tech. Rep. METR2005-30, Department of Mathematical Engineering and Information Physics, University of Tokyo, 2005.
27. D.A. Bader, S. Sreshta, N.R. Weisse-Bernstein, Evaluating arithmetic expressions using tree contraction: a fast and scalable parallel implementation for symmetric multiprocessors (SMPs), in: Ninth International Conference on High Performance Computing (HiPC 2002), Lecture Notes in Computer Science 2552, Bangalore, India, 2002, pp. 63-75.
28. Mayr E.W., and Werchner R. Optimal tree contraction and term matching on the hypercube and related networks. Algorithmica 18 3 (1997) 445-460
29. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press
30. SkeTo project homepage. Available from: , 2005.
31. K. Matsuzaki, K. Emoto, H. Iwasaki, Z. Hu, A library of constructive skeletons for sequential style of parallel programming, in: First International Conference on Scalable Information Systems (INFOSCALE 2006), Hong Kong, May 29-June 1, 2006.
32. Kazai G., Lalmas M., Fuhr N., and Gövert N. A report on the first year of the INitiative for the Evaluation of XML retrieval (INEX'02). Journal of the American Society for Information Science and Technology 55 6 (2002)
33. Ahn J., and Han T. An analytical method for parallelization of recursive functions. Parallel Processing Letters 10 1 (2000) 87-98
34. Cole R., and Vishkin U. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica 3 (1988) 329-346
35. Diks K., and Hagerup T. More general parallel tree contraction: register allocation and broadcasting in a tree. Theoretical Computer Science 203 1 (1998) 3-29
36. Blelloch G.E., Hardwick J.C., Sipelstein J., Zagha M., and Chatterjee S. Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing 21 1 (1994) 4-14
37. Palmer D., Prins J., Chatterjee S., and Faith R. Piecewise execution of nested data-parallel programs. Languages and Compilers for Parallel Computing: Eighth International Workshop, Columbus, OH, USA, August 10-12, 1995 Proceedings. Lecture Notes in Computer Science 1033 (1996), Springer-Verlag 346-361