Abstract
The backtracking is a basic combinatorial search algorithm. As many other deterministic methods it suffers from the high complexity. Fortunately the high performance computing can efficiently cope with this issue. It was observed that the structure of the search tree can dramatically affect the efficiency of a parallel search. We study the complexity of a frontal autonomous scheme for the backtrack search parallelization. In this approach several independent cores perform a number of first steps of the backtrack search. After that each core takes one sub-problem and solves it completely. Then the results are merged to select the best solution. To study the impact of the tree structure on the performance of the frontal autonomous scheme we formalize the notion of a perfectly scalable problem and prove a criterion for a search tree to fit to this class.
Partially supported by Russian fund for basic research, project 18-07-00566, and by Program 2 of Presidium of RAS “Mechanisms for ensuring fault tolerance in modern high-performance and highly reliable computing”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
By the length of a path we mean the number of edges contained in the path.
References
Barnett, M., Shuler, L., van De Geijn, R., Gupta, S., Payne, D.G., Watts, J.: Interprocessor collective communication library (intercom). In: Proceedings of IEEE Scalable High Performance Computing Conference, pp. 357–364. IEEE (1994)
Bhatt, S., Greenberg, D., Leighton, T., Liu, P.: Tight bounds for on-line tree embeddings. SIAM J. Comput. 29(2), 474–491 (1999)
Evtushenko, Y., Posypkin, M., Sigal, I.: A framework for parallel large-scale global optimization. Comput. Sci. Res. Dev. 23(3–4), 211–215 (2009)
Herley, K.T., Pietracaprina, A., Pucci, G.: Deterministic parallel backtrack search. Theoret. Comput. Sci. 270(1–2), 309–324 (2002)
Karp, R.M., Zhang, Y.: Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. ACM (JACM) 40(3), 765–789 (1993)
Knuth, D.E.: Art of Computer Programming, volume 2: Seminumerical Algorithms. Addison-Wesley Professional, Boston (2014)
Kolpakov, R., Posypkin, M.: Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem. J. Comput. Syst. Sci. Int. 50(5), 756 (2011)
Kolpakov, R., Posypkin, M.: The lower bound on complexity of parallel branch-and-bound algorithm for subset sum problem. In: AIP Conference Proceedings, vol. 1776, p. 050008. AIP Publishing (2016)
Kolpakov, R.M., Posypkin, M.A., Sigal, I.K.: On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method. Autom. Remote Control 71(10), 2152–2161 (2010)
Pietracaprina, A., Pucci, G., Silvestri, F., Vandin, F.: Space-efficient parallel algorithms for combinatorial search problems. J. Parallel Distrib. Comput. 76, 58–65 (2015)
Sergeyev, Y., Grishagin, V.: Parallel asynchronous global search and the nested optimization scheme. J. Comput. Anal. Appl. 3(2), 123–145 (2001)
Strongin, R., Sergeyev, Y.: Global multidimensional optimization on parallel computer. Parallel Comput. 18(11), 1259–1273 (1992)
Wu, I.C., Kung, H.T.: Communication complexity for parallel divide-and-conquer. In: 32nd Annual Symposium on Foundations of Computer Science, 1991 Proceedings, pp. 151–162. IEEE (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Kolpakov, R., Posypkin, M. (2020). A Criterion of Optimality of Some Parallelization Scheme for Backtrack Search Problem in Binary Trees. In: Jaćimović, M., Khachay, M., Malkova, V., Posypkin, M. (eds) Optimization and Applications. OPTIMA 2019. Communications in Computer and Information Science, vol 1145. Springer, Cham. https://doi.org/10.1007/978-3-030-38603-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-030-38603-0_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38602-3
Online ISBN: 978-3-030-38603-0
eBook Packages: Computer ScienceComputer Science (R0)