[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy. We show that if we do not split the data too thoroughly, we may obtain a more cost-effective parallel algorithm. A theoretical result about how much we should split the data is also presented.[[fileno]]2030209010043[[department]]資訊工程學
We present a new parallel computation model called the Parallel Resource-Optimal computation model. ...
Mapping of parallel programs onto parallel computers for efficient execution is a fundamental proble...
Abstract This paper shows a concept for parallelization of double Divide and Conquer and its prelimi...
Divide{and{conquer algorithms obtain the solution to a problem by recursively dividing it into subpr...
this paper we evaluate the performance of several parallel divide--and--conquer algorithms which are...
AbstractA strategy for designing divide-and-conquer algorithms that was originally presented in a pr...
Abstract: "This paper studies the relationship between parallel computation cost and communication c...
Abstract. A formal algebraic model for divide-and-conquer algorithms i presented. The model reveals ...
AbstractThis paper outlines a theory of parallel algorithms that emphasizes two crucial aspects of p...
This paper discusses a scalability metric based on the cost effectiveness of parallel algorithms. Un...
We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algo...
In this paper, we present a new method of performing Division in Hardware and explore different ways...
During the past decade there has been a tremendous surge in understanding the nature of parallel com...
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing...
We present a new parallel computation model called the Parallel Resource-Optimal computation model. ...
Mapping of parallel programs onto parallel computers for efficient execution is a fundamental proble...
Abstract This paper shows a concept for parallelization of double Divide and Conquer and its prelimi...
Divide{and{conquer algorithms obtain the solution to a problem by recursively dividing it into subpr...
this paper we evaluate the performance of several parallel divide--and--conquer algorithms which are...
AbstractA strategy for designing divide-and-conquer algorithms that was originally presented in a pr...
Abstract: "This paper studies the relationship between parallel computation cost and communication c...
Abstract. A formal algebraic model for divide-and-conquer algorithms i presented. The model reveals ...
AbstractThis paper outlines a theory of parallel algorithms that emphasizes two crucial aspects of p...
This paper discusses a scalability metric based on the cost effectiveness of parallel algorithms. Un...
We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algo...
In this paper, we present a new method of performing Division in Hardware and explore different ways...
During the past decade there has been a tremendous surge in understanding the nature of parallel com...
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing...
We present a new parallel computation model called the Parallel Resource-Optimal computation model. ...
Mapping of parallel programs onto parallel computers for efficient execution is a fundamental proble...
Abstract This paper shows a concept for parallelization of double Divide and Conquer and its prelimi...
DOI
Add to ORKG