Abstract
This paper presents a methodology to derive CGM (Coarse Grain Multicomputer) parallel algorithms for the cost of the Optimal Binary Search Tree Problem (OBST Problem). Depending on the parameter we want to optimize, we derive an algorithm accordingly. Therefore a load balancing, an efficient and a minimum communication rounds algorithms are obtained. Our CGM algorithms use p processors, each with O(n 2 /p) local memory. The best one in communication requires O(p 1/2 ) communication rounds and O(n 2 /p) computations on each processor. Another one with the best time efficiency needs only O(n 2 /p) time steps. All local computations on processors are based on the Knuth sequential algorithm for the OBST problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alves, C.E.R., Cáceres, E.N., Dehne, F.: Parallel dynamic programming for solving the string editing problem on a CGM/BSP. In: SPAA 2002, pp. 275–281. ACM, New York (2002)
Alves, C.E.R., Cáceres, E.N., Dehne, F., Song, S.W.: A parallel wavefront algorithm for efficient biological sequence comparison. In: ICCSA 2003, pp. 249–258 (2003)
Alves, C.E.R., Caceres, E.N., Song, S.W.: A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica 45, 301–335 (2006)
Bradford, P.G.: Parallel dynamic programming. Ph.D. thesis, Indiana University (1994)
Cheatham, T., Fahmy, A.F., Stefanescu, D.C., Valiant, L.G.: Bulk synchronous parallel computing-a paradigm for transportable software. In: HICSS, vol. 2, pp. 268–275 (1995)
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. International Journal of Computational Geometry and Applications 6(3), 379–400 (1996)
Fotso, L.P., Tchendji, V.K., Myoupo, J.F.: Load balancing schemes for parallel processing of dynamic programming on BSP/CGM model. In: PDPTA, pp. 710–716 (2010)
Garcia, T., Myoupo, J.F., Seme, D.: A coarse-grained multicomputer algorithm for the longest common subsequence problem. In: PDP, pp. 349–356 (2003)
Guibas, L.J., Kung, H.T., Thompson, C.D.: Direct VLSI implementation of combinatorial algorithms. In: Proceedings of Conference on Very Large Scale Integration, California Institute of Technology, pp. 509–525 (1979)
Karypis, G., Kumar, V.: Efficient parallel mappings of a dynamic programming algorithm: a summary of results. In: IPPS, pp. 563–568 (1993)
Kechid, M., Myoupo, J.F., Khalufa, A.S., Alghamdi, M.S.: Mapping dynamic programming problems on coarse grained multicomputer. In: ICIA2012, pp. 487–499. The Society of Digital Information and Wireless Communication (2012)
Kechid, M., Myoupo, J.F.: A coarse grain multicomputer algorithm solving the optimal binary search tree problem. In: Proceedings of the Fifth International Conference on Information Technology: New Generations, pp. 1186–1189. IEEE Computer Society, Washington, DC (2008)
Kechid, M., Myoupo, J.F.: An efficient BSP/CGM algorithm for the matrix chain ordering problem. In: PDPTA, Las Vegas, pp. 327–332, July 2008
Knuth, D.E.: Optimum binary search trees. Acta Informatica 1(3), 14–25 (1972)
Myoupo, J.F., Tchendji, V.K.: An efficient cgm-based parallel algorithm solving the matrix chain ordering problem. International Journal of Grid and High Performance Computing (IJGHPC) 6(2), 74–100 (2014)
Myoupo, J.F., Tchendji, V.K.: Parallel dynamic programming for solving the optimal search binary tree problem on CGM. International Journal of High Performance Computing and Networking 7(4), 269–280 (2014)
Tchendji, V.K., Myoupo, J.F.: An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem. The Journal of Supercomputing 61, 463–480 (2012)
Valiant, L.G.: Bulk-synchronous parallel computers. In: Parallel Processing and Artificial Intelligence, pp. 15–22 (1989)
Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33, 103–111 (1990)
Yao, F.F.: Speed-up in dynamic programming. SIAM Journal on Matrix Analysis and Applications (formerly SIAM Journal on Algebraic and Discrete Methods) 3(4), 532–540 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Tchendji, V.K., Myoupo, J.F., Dequen, G. (2016). Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem. In: Latifi, S. (eds) Information Technology: New Generations. Advances in Intelligent Systems and Computing, vol 448. Springer, Cham. https://doi.org/10.1007/978-3-319-32467-8_57
Download citation
DOI: https://doi.org/10.1007/978-3-319-32467-8_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32466-1
Online ISBN: 978-3-319-32467-8
eBook Packages: EngineeringEngineering (R0)