Results 1 - 10 of 1,835

Divide-and-Conquer Algorithms on the Hypercube

by Ernst W. Mayr, Ralph Werchner - Theoretical Computer Science , 1993
"... We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recursi ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level

Divide-and-Conquer Algorithms on the Hypercube

by Alle Rechte Vorbehalten, Ernst W. Mayr, Ernst W. Mayr, Ralph Werchner, Ralph Werchner, Fachbereich Informatik - Theoretical Computer Science , 1993
"... We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recu ..."
Abstract - Add to MetaCart
We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level

Supporting Divide-and-Conquer Algorithms for Image Processing

by Quentin F. Stout - JOURNAL OF PARALLEL AND DISTBIBUTED COMPUTING 4,95- 115 , 1987
"... Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconnection scheme such as a mesh, mesh with br ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconnection scheme such as a mesh, mesh

A Divide-and-Conquer Algorithm for

by Betweenness Centrality, Vatche Ishakian, Azer Bestavros, Evimaria Terzi
"... Abstract. The problem of efficiently computing the betweenness cen-trality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes [7]. The contribution of our paper is Brandes++, an algo-rithm for ex ..."
Abstract - Add to MetaCart
Abstract. The problem of efficiently computing the betweenness cen-trality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes [7]. The contribution of our paper is Brandes++, an algo-rithm

Performance Evaluation of Parallel Divide-and-Conquer Algorithms

by Bernd Freisleben, Thilo Kielmann , 1993
"... this paper we evaluate the performance of several parallel divide--and--conquer algorithms which are created in a uniform manner by a software system developed for automatically transforming a sequential divide--and--conquer algorithm into parallel code, instead of individually designing a parallel ..."
Abstract - Add to MetaCart
this paper we evaluate the performance of several parallel divide--and--conquer algorithms which are created in a uniform manner by a software system developed for automatically transforming a sequential divide--and--conquer algorithm into parallel code, instead of individually designing a parallel

Automatic Parallelization of Divide--and--Conquer Algorithms

by Bernd Freisleben, Thilo Kielmann
"... . In this paper we present a system that automatically partitions sequential divide--and--conquer algorithms programmed in C into independent tasks, maps these to a MEIKO transputer system and executes them in parallel. The feasibility of our approach is illustrated by parallelizing several example ..."
Abstract - Add to MetaCart
. In this paper we present a system that automatically partitions sequential divide--and--conquer algorithms programmed in C into independent tasks, maps these to a MEIKO transputer system and executes them in parallel. The feasibility of our approach is illustrated by parallelizing several example

Divide-and-Conquer Algorithms on Two-Dimensional Meshes

by Miguel Valero-García, Antonio González, Luis Díaz de Cerio, Two-dimensional Meshes, Luis D��az De Cerio, Dolors Royo , 1997
"... The Reflecting and Growing mappings have been proposed to map parallel divide-and-conquer algorithms onto two-dimensional meshes. The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh. I ..."
Abstract - Add to MetaCart
The Reflecting and Growing mappings have been proposed to map parallel divide-and-conquer algorithms onto two-dimensional meshes. The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh

Practical Parallel Divide-and-Conquer Algorithms

by Jonathan Hardwick , 1997
"... Nested data parallelism has been shown to be an important feature of parallel languages, allowing the concise expression of algorithms that operate on irregular data structures such as graphs and sparse matrices. However, previous nested dataparallel languages have relied on a vector PRAM impleme ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
implementation layer that cannot be efficiently mapped to MPPs with high inter-processor latency. This thesis shows that by restricting the problem set to that of data-parallel divide-and-conquer algorithms I can maintain the expressibility of full nested data-parallel languages while achieving good

A Divide-and-Conquer Algorithm for Betweenness Centrality ∗

by Vatche Ishakian, Azer Bestavros, Evimaria Terzi , 2015
"... Given a set of target nodes S in a graph G we define the betweenness centrality of a node v with respect to S as the fraction of shortest paths among nodes in S that contain v. For this setting we describe Brandes++, a divide-and-conquer algorithm that can efficiently compute the exact values of bet ..."
Abstract - Add to MetaCart
Given a set of target nodes S in a graph G we define the betweenness centrality of a node v with respect to S as the fraction of shortest paths among nodes in S that contain v. For this setting we describe Brandes++, a divide-and-conquer algorithm that can efficiently compute the exact values

The Automatic Complexity Analysis of Divide-And-Conquer Algorithms

by E De Recherche, Et En Automatique, Domaine De Voluceau, Paul Zimmermann, Paul Zimmermann, Wolf Zimmermann, Wolf Zimmermann , 1989
"... : Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. Divide-and-Conquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction. This p ..."
Abstract - Add to MetaCart
: Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. Divide-and-Conquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction
Results 1 - 10 of 1,835