• Home
  • Search
  • On Generalizing Divide and Conquer Parallel Programming Pattern
  • Cite Icon2
  • https://doi.org/10.3390/math10213925Copy DOI Icon

On Generalizing Divide and Conquer Parallel Programming Pattern

Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

(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 to the solutions of subproblems of the same type, but of smaller sizes. This pattern allows the specification of different types of computations, and so it is important to provide a general specification that comprises all its cases. We intend to prove that the divide-and-conquer pattern could be generalized such that to comprise many of the other parallel programming patterns, and in order to prove this, we provide a general formulation of it. (2) Methods: Starting from the proposed generalized specification of the divide-and-conquer pattern, the computation of the pattern is analyzed based on its stages: decomposition, base-case and composition. Examples are provided, and different execution models are analyzed. (3) Results: a general functional specification is provided for a divide-and-conquer pattern and based on it, and we prove that this general formulation could be specialized through parameters’ instantiating into other classical parallel programming patterns. Based on the specific stages of the divide-and-conquer, three classes of computations are emphasized. In this context, an equivalent efficient bottom-up computation is formally proved. Associated models of executions are emphasized and analyzed based on the three classes of divide-and-conquer computations. (4) Conclusion: A more general definition of the divide-and-conquer pattern is provided, and this includes an arity list for different decomposition degrees, a level of recursion, and also an alternative solution for the cases that are not trivial but allow other approaches (sequential or parallel) that could lead to better performance. Together with the associated analysis of patterns equivalence and optimized execution models, this provides a general formulation that is useful both at the semantic level and implementation level.

Loading PDF

Similar Papers
  • Conference Article
  • Citations2

Parallel programming patterns with granular computing

  • Oct 01, 2010
  • Zhang Junhua +2
  • Research Article

Facilitating parallel and distributed computing

  • Jan 03, 2001
  • Scalable Computing Practice and Experience
  • L M Patnaik +2
  • Research Article
  • Citations4

Exploitation of locality for energy efficiency for breadth first search in fine-grain execution models

  • Dec 01, 2013
  • Tsinghua Science and Technology
  • Chen Chen +2
  • Book Chapter
  • Citations4

A General Framework for Static Cost Analysis of Parallel Logic Programs

  • Jan 01, 2020
  • Maximiliano Klemen +4
  • Dissertation
  • Citations90

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.

  • Aug 01, 1986
  • Manuel V Hermenegildo
  • Research Article
  • Citations30

Bringing Parallel Patterns Out of the Corner

  • Oct 24, 2017
  • ACM Transactions on Architecture and Code Optimization
  • Daniele De Sensi +4
  • Conference Article
  • Citations17

A Minimalistic Dataflow Programming Library for Python

  • Oct 01, 2014
  • Tiago A.O Alves +3
  • Research Article

A Pattern-based Refactoring Approach for Multi-core System Design

  • Oct 31, 2011
  • International Journal of Advancements in Computing Technology
  • Nienlin Hsueh - +8
  • Research Article
  • Citations1

Parallel execution of Prolog with granularity control

  • May 01, 1998
  • Future Generation Computer Systems
  • Lourdes Araujo +1
  • Research Article
  • Citations21

GRace

  • Feb 12, 2011
  • ACM SIGPLAN Notices
  • Mai Zheng +3
  • Research Article
  • Citations48

The NAS Parallel Benchmarks for evaluating C++ parallel programming frameworks on shared-memory architectures

  • Jul 19, 2021
  • Future Generation Computer Systems
  • Júnior Löff +6
  • Research Article
  • Citations48

MUSKEL: an expandable skeleton environment

  • Jan 01, 2007
  • Scalable Computing Practice and Experience
  • Marco Aldinucci +2
  • Research Article
  • Citations12

An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications

  • Jan 11, 2010
  • Computer Languages, Systems & Structures
  • Cristian Mateos +2
  • Conference Article

The MAP3S Static-and-Regular Mesh Simulation and Wavefront Parallel-Programming Patterns

  • Sep 01, 2008
  • Robert Niewiadomski +2
  • Research Article
  • Citations35

Optimal Execution with Dynamic Order Flow Imbalance

  • Jan 01, 2015
  • SIAM Journal on Financial Mathematics
  • Kyle Bechler +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.