Re-engineering the ant colony optimization for CMP architectures

• Published in: The Journal of supercomputing Vol. 76; no. 6; pp. 4581 - 4602
• Main Authors: Cecilia, José M., García, José M.
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.06.2020; Springer Nature B.V
• Subjects: Algorithms; Ant colony optimization; Compilers; Computer Science; Interpreters; Parallel processing; Processor Architectures; Programming Languages; Reengineering; Synchronism; Traveling salesman problem; Performance evaluation; TSP; Ant colony optimization; CMP code redesign; Parallel and distributed ACO; Intel Xeon Phi
• ISSN: 0920-8542; 1573-0484; 1573-0484
• DOI: 10.1007/s11227-019-02869-8

The ant colony optimization (ACO) is inspired by the behavior of real ants, and as a bioinspired method, its underlying computation is massively parallel by definition. This paper shows re-engineering strategies to migrate the ACO algorithm applied to the Traveling Salesman Problem to modern Intel-based multi- and many-core architectures in a step-by-step methodology. The paper provides detailed guidelines on how to optimize the algorithm for the intra-node (thread and vector) parallelization, showing the performance scalability along with the number of cores on different Intel architectures, reporting up to 5.5x speedup factor between the Intel Xeon Phi Knights Landing and Intel Xeon v2. Moreover, parallel efficiency is provided for all targeted architectures, finding that core load imbalance, memory bandwidth limitations, and NUMA effects on data placement are some of the key factors limiting performance. Finally, a distributed implementation is also presented, reaching up to 2.96x speedup factor when running the code on 3 nodes over the single-node counterpart version. In the latter case, the parallel efficiency is affected by the synchronization frequency, which also affects the quality of the solution found by the distributed implementation.