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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
MDPI AG
2022-10-01
|
| Serija: | Mathematics |
| Teme: | |
| Online pristup: | https://www.mdpi.com/2227-7390/10/21/3925 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|