Results 1  10
of
1,832,682
On the Granularity of DivideandConquer Parallelism
 In Glasgow Workshop on Functional Programming, Workshops in Computing, Ullapool
, 1995
"... Published in collaboration with the ..."
Cut Problems And Their Application To DivideAndConquer
, 1996
"... INTRODUCTION 5.1 One of the most important paradigms in the design and analysis of algorithms is the notion of a divideandconquer algorithm. Every undergraduate course on algorithms teaches this method as one of its staples: to solve a problem quickly, one carefully splits the problem into two s ..."
Abstract

Cited by 84 (0 self)
 Add to MetaCart
INTRODUCTION 5.1 One of the most important paradigms in the design and analysis of algorithms is the notion of a divideandconquer algorithm. Every undergraduate course on algorithms teaches this method as one of its staples: to solve a problem quickly, one carefully splits the problem into two
Iteration Schemes for the DivideandConquer Eigenvalue Solver
, 1994
"... this paper we improve the results of [3] by proposing different techniques for both of the stages of the algorithm. Concerning the first stage we compute the intervals by applying Sturm sequences, thus reducing the cost bound by a multiplicative factor. Concerning the second stage we introduce and a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
and analyze two iteration schemes, denoted as Schemes 1 and 2, which converge superlinearly right from the start, thus requiring a number of iterations independent of n. In particular, in the case where a complete separation of the eigenvalues can be performed, we prove the cubic convergence of Scheme 1 right
A DivideandConquer Approach to Evolvable Hardware
 Evolvable Systems: From Biology to Hardware. Second Int. Conf., ICES 98
, 1998
"... . Evolvable Hardware (EHW) has been proposed as a new method for designing systems for complex real world applications. One of the problems has been that only small systems have been evolvable. This paper indicates some of the aspects in biological systems that are important for evolving complex sys ..."
Abstract

Cited by 49 (10 self)
 Add to MetaCart
systems. Further, a divideandconquer scheme is proposed, where a system is evolved by evolving smaller subsystems. Experiments show that the number of generations required for evolution by the new method can be substantially reduced compared to evolving a system directly. However, there is no lack
Communication Complexity for Parallel DivideandConquer
 In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science
, 1991
"... This paper studies the relationship between parallel computation cost and communication cost for performing divideandconquer (D&C) computations on a parallel system of p processors. The parallel computation cost is the maximal number of the D&C nodes that any processor in the parallel syst ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
This paper studies the relationship between parallel computation cost and communication cost for performing divideandconquer (D&C) computations on a parallel system of p processors. The parallel computation cost is the maximal number of the D&C nodes that any processor in the parallel
Parallelization of DivideandConquer by Translation to Nested Loops
 J. Functional Programming
, 1997
"... We propose a sequence of equational transformations and specializations which turns a divideandconquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divideandconquer. The specializations impose a balanced call tree, a fixed degree of the prob ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
We propose a sequence of equational transformations and specializations which turns a divideandconquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divideandconquer. The specializations impose a balanced call tree, a fixed degree
Exact Asymptotics of DivideandConquer Recurrences
"... The divideandconquer principle is a major paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in the algorithm. This work shows that periodicity phenomena, often of a fractal nature, are ubiquitous in the performanc ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The divideandconquer principle is a major paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in the algorithm. This work shows that periodicity phenomena, often of a fractal nature, are ubiquitous
A divideandconquer method for the Takagi factorization
 SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
, 2008
"... This paper presents a divideandconquer method for computing the symmetric singular value decomposition, or Takagi factorization, of a complex symmetric and tridiagonal matrix. An analysis of accuracy shows that our method produces accurate Takagi values and orthogonal Takagi vectors. Our prelimina ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper presents a divideandconquer method for computing the symmetric singular value decomposition, or Takagi factorization, of a complex symmetric and tridiagonal matrix. An analysis of accuracy shows that our method produces accurate Takagi values and orthogonal Takagi vectors. Our
Practical Parallel DivideandConquer Algorithms
, 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 interprocessor latency. This thesis shows that by restricting the problem set to that of dataparallel divideandconquer algorithms I can maintain the expressibility of full nested dataparallel languages while achieving good
The Automatic Complexity Analysis of DivideAndConquer Algorithms
, 1989
"... : Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. DivideandConquer 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. DivideandConquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction
Results 1  10
of
1,832,682