Results 1  10
of
282,514
Load Balancing of Irregular Parallel DivideandConquer Algorithms in GroupSPMD Programming Environments
 Master’s Thesis, PELAB, Linköpings Universitet
, 2006
"... We study strategies for local load balancing of irregular parallel divideandconquer algorithms such as Quicksort and Quickhull in SPMDparallel environments such as MPI and Fork that allow to exploit nested parallelism by dynamic group splitting. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We study strategies for local load balancing of irregular parallel divideandconquer algorithms such as Quicksort and Quickhull in SPMDparallel environments such as MPI and Fork that allow to exploit nested parallelism by dynamic group splitting.
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
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
Automated Transformation of Sequential DivideandConquer Algorithms into Parallel Programs
 Computers and Artificial Intelligence
, 1995
"... Divideandconquer algorithms obtain the solution to a given problem by dividing it into subproblems, solving these recursively and combining their solutions. In this paper we present a system that automatically transforms sequential divideandconquer algorithms written in the C programming lan ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Divideandconquer algorithms obtain the solution to a given problem by dividing it into subproblems, solving these recursively and combining their solutions. In this paper we present a system that automatically transforms sequential divideandconquer algorithms written in the C programming
An Efficient Implementation of Nested Data Parallelism for Irregular DivideandConquer Algorithms
 FIRST INTERNATIONAL WORKSHOP ON HIGHLEVEL PROGRAMMING MODELS AND SUPPORTIVE ENVIRONMENTS, APRIL 1996.
, 1996
"... This paper presents work in progress on a new method of implementing irregular divideandconquer algorithms in a nested dataparallel language model on distributedmemory multiprocessors. The main features discussed are the recursive subdivision of asynchronous processor groups to match the change f ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
This paper presents work in progress on a new method of implementing irregular divideandconquer algorithms in a nested dataparallel language model on distributedmemory multiprocessors. The main features discussed are the recursive subdivision of asynchronous processor groups to match the change
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Adaptive LoadBalancing for DivideandConquer Grid Applications
 J. of Supercomputing
, 2004
"... Divideandconquer has been demonstrated as a simple and e#cient programming model for grid applications. In previous work, we have presented the divideandconquer based Satin system and its load balancing algorithm, clusteraware work stealing (CRS). In this paper, we provide a detailed analysis of ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Divideandconquer has been demonstrated as a simple and e#cient programming model for grid applications. In previous work, we have presented the divideandconquer based Satin system and its load balancing algorithm, clusteraware work stealing (CRS). In this paper, we provide a detailed analysis
Development and Tuning of Irregular DivideandConquer Applications in DAMPVM/DAC
 In: Recent Advances in Parallel Virtual Machine and Message Passing Interface. Number 2474 in Lecture Notes in Computer Science, SpringerVerlag (2002) 208–216 9th European PVM/MPI Users’ Group Meeting
"... Abstract. This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAMPVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divideandconquer (DAC) applications at runtime and ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAMPVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divideandconquer (DAC) applications at runtime
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1173 (16 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
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
Results 1  10
of
282,514