Parallel implementation of tree skeletons

Journal of Parallel and Distributed Computing

Volumn 39, Issue 2, 1996, Pages 115-125

  Skillicorn, D B ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030589752     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0160     Document Type: Article

References (21)

1. 1. Abrahamson, K., Dadoun, N., Kirkpatrick, D. G., and Przytycka, T. A simple parallel tree contraction algorithm. Proceedings of the Twenty-Fifth Allerton Conference on Communication, Control and Computing. 1987, pp. 624-633.
2. 2. Bayer, R., and McCreight, E. Organization and maintenance of large ordered indexes. Acta Informat. 1, 3 (1972), 173-189.
3. 3. Blelloch, Guy E., NESL: A nested data-parallel language. Technical Report CMU-CS-93-129, Carnegie Mellon University, 1993.
4. 4. Brent, R., Kuck, D., and Maruyamen, K. The parallel evaluation of arithmetic expressions without division. IEEE Trans. Comput. C-22, 5 (1973), 532-534.
5. 5. Chaudhuri, B. B. Applications of quadtree, octree, and binary tree decomposition techniques to shape analysis and pattern recognition. IEEE Trans. Pattern Anal. Mach. Intelligence 7 (1985), 652-661.
6. 6. Cole, M. Algorithmic Skeletons: Structured Management of Parallel Computation, Research Monographs in Parallel and Distributed Computing. Pitman, 1989.
7. 7. Cole, R. and Vishkin, U. Faster optimal parallel prefix sums and list ranking. Inform. and Control 81 (1989), 334-352.
8. 8. Duff, I. S., Erisman, A., and Reid, J. K. Direct Methods for Sparse Matrices. Clarendon, Oxford, 1986.
9. 9. Gibbons, Alan and Rytter, Wojciech. Efficient Parallel Algorithms. Cambridge Univ. Press, 1988.
10. 10. ISO. Information processing - text and office systems - standard generalized markup language (SGML). 1986.
11. 11. Knuth, D. E. The Art of Computer Programming, Vol. I; Fundamental Algorithms. Addison-Wesley, Reading, MA, 1973.
12. 12. Malcolm, G. Algebraic data types and program transformations. Ph.D. thesis, Rijksuniversiteit Groningen, September 1990.
13. 13. Mayr, E. W. and Werchner, R. Optimal routing of parentheses on the hypercube. Proceedings of the Symposium on Parallel Architectures and Algorithms. 1993.
14. 14. Miller, G. L. and Reif, J. Parallel tree contraction and its application. 26th IEEE Symposium on Foundations of Computer Science. 1985, pp. 478-489.
15. 15. Roe, P. Parallel programming using functional languages. Ph.D. thesis, Department of Computer Science, University of Glasgow, 1991.
16. 16. Skillicorn, D. B. Foundations of Parallel Programming, Cambridge Series in Parallel Computation. Cambridge Univ. Press, Cambridge, UK, 1994.
17. 17. Skillicorn, D. B. Structured parallel computation in structured documents. Technical Report 95-379, Queen's University, Department of Computing and Information Science, 1995.
18. 18. Skillicorn, D. B. and Cai, W. Equational code generation: Implementing categorical data types for data parallelism. Proceedings of TENCON '94. Singapore, 1994.
19. 19. Skillicorn, D. B. and Cai, W. A cost calculus for parallel functional programming. J. Parallel Distrib. Comput. 28, 1 (July 1995), 65-83.
20. 20. Wirth, N. Algorithms and Data Structures. Prentice-Hall, New York, 1986.
21. 21. Wyvill, Geoff and Kunii, Tosiyasu L. A functional model for constructive solid geometry. Visual Comput. 1, (July 1985), 3-14.