Access Restriction

Author Carneiro, Tiago ♦ Melab, Nouredine
Source Hyper Articles en Ligne (HAL)
Content type Text
File Format PDF
Language English
Subject Keyword MPI+OpenMP ♦ Chapel ♦ Tree search algorithms ♦ High productivity ♦ PGAS ♦ info ♦ Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Abstract Parallel tree search algorithms offer viable solutions to problems in different areas, such as operations research, machine learning and artificial intelligence. This class of algorithms is highly compute-intensive, irregular and usually relies on context-specific data structures and handmade code optimizations. Therefore, C and C++ are the languages often employed, due to their low-level features and performance. In this work, we investigate the use of Chapel high-productivity language for the design and implementation of distributed tree search algorithms for solving combinatorial problems. The experimental results show that Chapel is a suitable language for this purpose, both in terms of performance and productivity. Despite the use of high-level features, the distributed tree search in Chapel is on average 16% slower and reaches up to 85% of the scalability observed for its MPI+OpenMP counterpart.
Educational Use Research
Learning Resource Type Proceeding