Abstract
A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP implementation regardless of the shapes of inputs. The prototype implementation supports its real efficacy.
Chapter PDF
Similar content being viewed by others
References
Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms 14 (1993)
Prasad, S., Das, S., Chen, C.: Efficient EREW PRAM algorithms for parentheses-matching. IEEE Transactions on Parallel and Distributed Systems 5(9) (1994)
Cole, M.: Parallel programming with list homomorphisms. Parallel Processing Letters 5 (1995)
Kravets, D., Plaxton, C.: All nearest smaller values on the hypercube. IEEE Transactions on Parallel and Distributed Systems 7(5) (1996)
He, X., Huang, C.: Communication efficient BSP algorithm for all nearest smaller values problem. Journal of Parallel and Distributed Computing 16 (2001)
Valiant, L.: A bridging model for parallel computation. Communication of the ACM 33(8) (1990)
Kakehi, K., Matsuzaki, K., Emoto, K., Hu, Z.: A practicable framework for tree reduction under distributed memory environments. Technical Report METR 2006-64, Department of Mathematical Informatics, University of Tokyo (2006)
Skillicorn, D.B.: Parallel implementation of tree skeletons. Journal of Parallel and Distributed Computing 39(2) (1996)
Matsuzaki, K., Hu, Z., Kakehi, K., Takeichi, M.: Systematic derivation of tree contraction algorithms. Parallel Processing Letters 15(3) (2005), Original version appeared in Proc. 4th International Workshop on Constructive Methodology of Parallel Programming (2004)
Mignet, L., Barbosa, D., Veltri, P.: The XML web: a fist study. In: Proceedings of the Twelfth International World Wide Web Conference, ACM Press, New York (2003)
Mayr, E.W., Werchner, R.: Optimal routing of parentheses on the hypercube. Journal of Parallel and Distributed Computing 26(2) (1995)
Mayr, E.W., Werchner, R.: Optimal tree contraction and term matching on the hypercube and related networks. Algorithmica 18(3) (1997)
Dehne, F., Ferreira, A., Cáceres, E., Song, S., Roncato, A.: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica 33(2) (2002)
Reid-Miller, M., Miller, G.L., Modugno, F.: List ranking and parallel tree contraction. In: Reif, J.H. (ed.) Synthesis of Parallel Algorithms, Morgan Kaufmann, San Francisco (1993)
SkeTo Project Home Page, http://www.ipl.t.u-tokyo.ac.jp/sketo/
Matsuzaki, K., Emoto, K., Iwasaki, H., Hu, Z.: A library of constructive skeletons for sequential style of parallel programming (invited paper). In: Proceedings of the First International Conference on Scalable Information Systems, IEEE Computer Society Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kakehi, K., Matsuzaki, K., Emoto, K. (2007). Efficient Parallel Tree Reductions on Distributed Memory Environments. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72586-2_88
Download citation
DOI: https://doi.org/10.1007/978-3-540-72586-2_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72585-5
Online ISBN: 978-3-540-72586-2
eBook Packages: Computer ScienceComputer Science (R0)