Massive parallelization of divide-and-conquer algorithms over powerlists
From MaRDI portal
Recommendations
- A data-parallel formulation for divide and conquer algorithms
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- A parallel algorithm for power matrix computation
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Efficient massively parallel implementation of some combinatorial algorithms
- Automated reasoning about parallel algorithms using powerlists
- scientific article; zbMATH DE number 2090611
- scientific article; zbMATH DE number 1445807
- scientific article; zbMATH DE number 741111
- Parallel algorithms and architectures for multisplitting iterative methods
Cited in
(11)- Parallelization of divide-and-conquer in the Bird-Meertens formalism
- A data-parallel formulation for divide and conquer algorithms
- Data-Distributions in PowerList Theory
- Pipelines for Divide-and-Conquer Functions
- scientific article; zbMATH DE number 1948454 (Why is no real title available?)
- scientific article; zbMATH DE number 1760062 (Why is no real title available?)
- scientific article; zbMATH DE number 2090611 (Why is no real title available?)
- Parallelization of divide-and-conquer by translation to nested loops
- Automated reasoning about parallel algorithms using powerlists
- Balanced trees inhabiting functional parallel programming
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
This page was built for publication: Massive parallelization of divide-and-conquer algorithms over powerlists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916359)
