An Analyzer for Program Parallelization and Optimization

Steinberg, Boris Ya.; Baglij, Anton; Petrenko, Victor; Burkhovetskiy, Victor Vitalyevich; Steinberg, Oleg; Metelica, Elena

doi:10.1145/3274856.3274875

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Parallel BnB tree traversal using a high-performance cluster and distributed memory is described in articles [16], [17]. Each node in the tree has offspring that are added to the task pool and distributed to nodes in the cluster.…”

Section: Literature Reviewmentioning

confidence: 99%

A parallel algorithm to find the exact solution of the travelling salesman problem

Al-Neama

Ahmed

Ali

2023

IJEECS

View full text Add to dashboard Cite

The traveling salesman problem (TSP) is a problem in computer science that has been extensively studied and has a wide variety of real-world applications. It is considered an NP-hard issue since the only way to get a precise solution to it is to wait an exponentially long amount of time unless P=NP. Both accurate and heuristic algorithms exist to tackle this problem. The Branch-and-Bound algorithm (BnB) is often regarded as the most significant precise approach, despite the fact that it traverses, in the worst scenario, all potential tours in order to calculate the tour efficiently. This study proposed an efficient parallel algorithm to solve TSP by using a cluster multicore system. An exact algorithm will be used to get the optimal solution, and to expedite the search for the best path, we have employed a multi-threaded approach that capitalizes on the processing power of multiple CPU cores to concurrently process sub-problems.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A parallel algorithm to find the exact solution of the travelling salesman problem

Al-Neama

Ahmed

Ali

2023

IJEECS

View full text Add to dashboard Cite

show abstract

Program transformations as the base for optimizing parallelizing compilers

Штейнберг¹,

Штейнберг²

2020

PSTA

View full text Add to dashboard Cite

В работе рассматриваются преобразования программ, приводящие к ускорению. Приводятся публикации о различных параллельных вычислительных архитектурах и инструментах разработки эффективных программ для них. Рассматривается сочетание распараллеливания и оптимизации доступа к модулям памяти разного уровня. Отмечается, что отставание автоматической оптимизации программ от потребностей новых архитектур сдерживает развитие новых перспективных вычислительных систем. Формулируются задачи развития теории преобразования программ и оптимизирующих (распараллеливающих) компиляторов, которые могли бы привести к существенному повышению производительности труда программистов. Статья обосновывает призыв к модернизации оптимизирующей компиляции.

show abstract

An Analyzer for Program Parallelization and Optimization

Cited by 2 publications

References 10 publications

A parallel algorithm to find the exact solution of the travelling salesman problem

A parallel algorithm to find the exact solution of the travelling salesman problem

Program transformations as the base for optimizing parallelizing compilers

Contact Info

Product

Resources

About