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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 10; no. 21; p. 3925
Main Author:	Niculescu, Virginia
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.11.2022
Subjects:	Algorithms Decomposition divide-and-conquer Equivalence execution models Mathematical research Object recognition (Computers) parallel computation Parallel programming Parallel programming (Computer science) Pattern analysis Pattern recognition patterns Power Semantics skeletons Software Specifications Romania
ISSN:	2227-7390, 2227-7390
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!