Parallel algorithms for tree accumulations

Journal of Parallel and Distributed Computing

Volumn 65, Issue 1, 2005, Pages 85-93

  Sevilgen, Fatih E ^a   Aluru, Srinivas ^b   Futamura, Natsuhiko ^c  

^a GEBZE TECHNICAL UNIVERSITY   (Turkey)

^b Iowa State University of Science and Technology   (United States)

^c Wright State University   (United States)

Author keywords

Downward accumulation; Parallel prefix; Tree contraction; Upward accumulation

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RANDOM ACCESS STORAGE; TREES (MATHEMATICS);

DOWNWARD ACCUMULATION; PARALLEL PREFIX; TREE CONTRACTION; UPWARD ACCUMULATION;

PARALLEL ALGORITHMS;

EID: 11444250305     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.09.001     Document Type: Article

References (25)

1. K. Abrahamson, N. Dadoun, D. Kirkpatrick, T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989) 287-302.
2. M. Atallah, S. Hambrusch, Solving tree problems on a meshconnected processor array, Inform. Control 69 (1986) 168-187.
3. D. Bader, S. Sreshta, N. Weisse-Bernstein, Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs), in: Proceedings of the International Conference on High Performance Computing, Lecture Notes in Computer Science, vol. 2552, Springer, Berlin, December 2002, pp. 63-75.
4. F. Dehne, A. Ferreira, E. Caceres, S.W. Song, A. Roncato, Efficient parallel graph algorithms for coarse-grained multicomputers and BSP, Algorithmica 33 (2002) 183-200.
5. K. Diks, T. Hagerup, More general parallel tree contraction: register allocation and broadcasting in a tree, Theoret. Comput. Sci. 203 (1998) 3-29.
6. H. Gazit, G. Miller, S. Teng, Optimal tree contraction in the EREW model, Concurrent Computations, Algorithms, Architecture and Technology, 1988, pp. 139-156.
7. A. Gibbons, Y. Srikant, A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation, Inform. Process. Lett. 32 (1989) 305-311.
8. J. Gibbons, Algebras for tree algorithms, Ph.D. Thesis, Oxford University, Oxford, 1991.
9. J. Gibbons, Computing downwards accumulations on trees quickly, Technical Report, University Auckland, 1995.
10. J. Gibbons, W. Cai, D. Skillicorn, Efficient parallel algorithms for tree accumulations, Sci. Comput. Programming 23 (1994) 1-18.
11. A. Grama, A. Gupta, G. Karypis, V. Kumar, An Introduction to Parallel Computing: Design and Analysis of Algorithms, second ed., Addison-Wesley Publishing, Reading, MA, 2003.
12. X. He, Efficient parallel algorithms for solving some tree problems, in: Proceedings of the 24th Allerton Conference on Communication, Control and Computing, 1986, pp. 777-786.
13. T. Hsu, V. Ramachandran, Efficient massively parallel implementation of some combinatorial algorithms, Theoret. Comput. Sci. 162 (1996) 297-322.
14. J. Jájá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
15. J. Jájá, K. Ryu, The block distributed memory model, Technical Report CS-TR-3207, Department of Computer Science, University of Maryland, 1994.
16. S. Kosaraju, A. Delcher, Optimal parallel evaluation of tree-structured computations by raking, in: Proceedings of the third Aegean Workshop on Computing, Lecture Notes in Computer Science, vol. 319, Springer, Berlin, 1988, pp. 101-110.
17. G. Miller, J. Reif, Parallel tree contraction and its application, in: Proceedings of IEEE Symposium on the Foundation of Computer Science, 1985, pp. 473-489.
18. G. Miller, J. Reif, Parallel tree contraction part2: Further application, SIAM J. Comput. 20 (6) (1991) 1128-1147.
19. S. Ranka, R. Shankar, K. Alsabti, Many-to-many communication with bounded traffic, in: Proceedings of the Frontiers of Massively Parallel Computation, 1995, pp. 20-27.
20. E. Reingold, J. Tilford, Tidier drawings of trees, IEEE Trans. Software Eng. 7 (2) (1981) 223-228.
21. K. Ryu, J. Jájá, Efficient algorithms for list ranking and for solving graph problems on the hypercube, IEEE Trans. Parallel Distrib. Systems 1 (1) (1990) 83-90.
22. F. Sevilgen, N. Futamura, S. Aluni, A provably optimal, distribution-independent parallel fast multipole method, in: Proceedings of the 14th International Parallel and Distributed Processing Symposium, IEEE Computer Society, Silverspring, MD, 2000, pp. 77-84.
23. J. Sibeyn, F. Guillaume, T. Seidel, Practical parallel list ranking, J. Parallel Distrib. Comput. 56 (1999) 156-180.
24. J. Sibeyn, I. Stadtwald, List ranking on meshes and networks, in: Proceedings of Computing Science in Netherlands, 1994, pp. 271-280.
25. R. Tarjan, U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (4) (1985) 862-874.