Abstract. A formal algebraic model for divide-and-conquer algorithms i presented. The model reveals the internal structure of divide-and-conquer functions, leads to high-level and functional-styled algorithms specification, and simplifies complexity analysis. Algorithms developed under the model contain vast amounts of parallelism and can be mapped fairly easily to parallel computers. 1
Abstract. In this paper we present a system that automatically partitions sequential divide{and{conq...
AbSlracl. T<:chniqucs for parallt:l divide-and-conquer are presenled. rcsulting in improved paral...
This paper gives an overview of some models of computation which have proved successful in laying a ...
Introduction 1.1 A Brief History Since the earliest days of computer programming, algorithms have ...
(1) Background: Structuring is important in parallel programming in order to master its complexity, ...
Divide{and{conquer algorithms obtain the solution to a problem by recursively dividing it into subpr...
AbstractA strategy for designing divide-and-conquer algorithms that was originally presented in a pr...
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....
AbstractThe structure common to a class of divide and conquer algorithms is represented by a program...
A tree machine consists of a number of processors (each with its own memory) mutually connected via ...
this paper we evaluate the performance of several parallel divide--and--conquer algorithms which are...
Introduction 1.1 A Brief History Since the earliest days of computer programming, algorithms have ...
Algorithms with a divide-and-conquer structure are suitable candidates for parallelization. The idea...
In this paper we present a simple language for expressing divide and conquer computations. The langu...
Abstract. In this paper we present a system that automatically partitions sequential divide{and{conq...
AbSlracl. T<:chniqucs for parallt:l divide-and-conquer are presenled. rcsulting in improved paral...
This paper gives an overview of some models of computation which have proved successful in laying a ...
Introduction 1.1 A Brief History Since the earliest days of computer programming, algorithms have ...
(1) Background: Structuring is important in parallel programming in order to master its complexity, ...
Divide{and{conquer algorithms obtain the solution to a problem by recursively dividing it into subpr...
AbstractA strategy for designing divide-and-conquer algorithms that was originally presented in a pr...
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....
AbstractThe structure common to a class of divide and conquer algorithms is represented by a program...
A tree machine consists of a number of processors (each with its own memory) mutually connected via ...
this paper we evaluate the performance of several parallel divide--and--conquer algorithms which are...
Introduction 1.1 A Brief History Since the earliest days of computer programming, algorithms have ...
Algorithms with a divide-and-conquer structure are suitable candidates for parallelization. The idea...
In this paper we present a simple language for expressing divide and conquer computations. The langu...
Abstract. In this paper we present a system that automatically partitions sequential divide{and{conq...
AbSlracl. T<:chniqucs for parallt:l divide-and-conquer are presenled. rcsulting in improved paral...
This paper gives an overview of some models of computation which have proved successful in laying a ...
DOI
Add to ORKG