On Generalizing Divide and Conquer Parallel Programming Pattern
(1) Background: Structuring is important in parallel programming in order to master its complexity, and this structuring could be achieved through programming patterns and skeletons. Divide-and-conquer computation is essentially defined by a recurrence relation that links the solution of a problem t...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2022-10-01
|
| Serie: | Mathematics |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/2227-7390/10/21/3925 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|