Buscar
Mostrando ítems 1-3 de 3
A general and efficient divide-and-conquer algorithm framework for multi-core clusters
(SpringerLink, 2017)
[Abstract]Divide-and-conquer is one of the most important patterns of parallelism, being applicable to a large variety of problems. In addition, the most powerful parallel systems available nowadays are computer clusters ...
A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems
(Springer Nature, 2021)
[Abstract] The Divide-and-conquer (D&C) pattern appears in a large number of problems and is highly suitable to exploit parallelism. This has led to much research on its easy and efficient application both in shared and ...
A Highly Optimized Skeleton for Unbalanced and Deep Divide-And-Conquer Algorithms on Multi-Core Clusters
(Springer, 2022)
[Abstract] Efficiently implementing the divide-and-conquer pattern of parallelism in distributed memory systems is very relevant, given its ubiquity, and difficult, given its recursive nature and the need to exchange tasks ...