The Scalability Analysis of a Parallel Tree Search Algorithm
Increasing the number of computational cores is a primary way of achieving high performance of contemporary supercomputers. However, developing parallel applications capable to harness the enormous amount of cores is a challenging task. Thus, studying the scalability of parallel algorithms (the growth order of the number of processors required to accommodate the growing amount of work, below we give a clear definition of the scalability investigated in our paper) is very important. In this paper we propose a parallel tree search algorithm aimed at distributed parallel computers. For this parallel algorithm, we perform a theoretical analysis of its scalability and show that the achieved scalability is close to the theoretical maximum.
KeywordsParallel scalability Parallel efficiency Complexity analysis Parallel tree search Global optimization
- 1.Baldwin, A., Asaithambi, A.: An efficient method for parallel interval global optimization. In: 2011 International Conference on High Performance Computing and Simulation (HPCS), pp. 317–321. IEEE (2011)Google Scholar
- 23.Wu, I.C., Kung, H.T.: Communication complexity for parallel divide-and-conquer. In: Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pp. 151–162. IEEE (1991)Google Scholar