Results 1  10
of
1,200
AUTOMATIC COARSEGRAINED PARALLELIZATION TECHNIQUES
"... Abstract. We present a complete automatic coarsegrained parallelization tool allowing the execution of sequential programs on distributed memory parallel computers. It is based on the PlusPyr parameterized task graph builder and a new dynamic scheduling algorithm whose computational complexity and ..."
Abstract
 Add to MetaCart
Abstract. We present a complete automatic coarsegrained parallelization tool allowing the execution of sequential programs on distributed memory parallel computers. It is based on the PlusPyr parameterized task graph builder and a new dynamic scheduling algorithm whose computational complexity
CoarseGrain Parallel Programming in Jade
, 1991
"... This paper presents Jade, a language which allows a programmer to easily express dynamic coarsegrain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and runtime system use this inf ..."
Abstract

Cited by 51 (4 self)
 Add to MetaCart
This paper presents Jade, a language which allows a programmer to easily express dynamic coarsegrain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and runtime system use
Coarse Grained Parallel Graph Planarity Testing
 IN INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS (PDPTA
, 2000
"... We present a coarse grained parallel algorithm for planarity testing and planar embedding. The algorithm ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a coarse grained parallel algorithm for planarity testing and planar embedding. The algorithm
CoarseGrain Parallel Computing Using the ISIS Toolkit
"... Abstract: A coarsegrained parallel (distributed) computing application using the ISIS toolkit is described. The method should be applicable to any serial program suitable for coarsegrain parallelization. Criteria for parallelizing existing programs, factors which affect the speed of parallel progr ..."
Abstract
 Add to MetaCart
Abstract: A coarsegrained parallel (distributed) computing application using the ISIS toolkit is described. The method should be applicable to any serial program suitable for coarsegrain parallelization. Criteria for parallelizing existing programs, factors which affect the speed of parallel
Optimizing Queries for Coarse Grain Parallelism
, 1993
"... We consider the problem of optimizing selectprojectjoin relational queries for minimum response time on parallel machines. The design of the optimizer is based on three ideas: (1) the concept and quantification of degree of coarse grain parallelism for an execution tree, (2) the design of a parall ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider the problem of optimizing selectprojectjoin relational queries for minimum response time on parallel machines. The design of the optimizer is based on three ideas: (1) the concept and quantification of degree of coarse grain parallelism for an execution tree, (2) the design of a
Exploiting CoarseGrain Parallelism in the MPEG2 Algorithm
, 1998
"... As the demand for multimedia applications increases, the performance of algorithms such as MPEG2 video compression on generalpurpose microprocessors is becoming more important. In this paper, we propose a number of coarsegrained parallel implementations of MPEG2 decoding and encoding. We evaluat ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
As the demand for multimedia applications increases, the performance of algorithms such as MPEG2 video compression on generalpurpose microprocessors is becoming more important. In this paper, we propose a number of coarsegrained parallel implementations of MPEG2 decoding and encoding. We
CoarseGrained Parallel Geometric Search
 Journal of Parallel and Distributed Computing
, 1999
"... This paper improves on op. cit. in several ways: (1) It studies the more general next element search problem which also solves, e.g., planar point location. (2) The algorithms require only O((n#p) log n) local computation instead of O(log p*(n#p) log n). (3) The algorithms require only O((n#p) l ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper improves on op. cit. in several ways: (1) It studies the more general next element search problem which also solves, e.g., planar point location. (2) The algorithms require only O((n#p) log n) local computation instead of O(log p*(n#p) log n). (3) The algorithms require only O((n#p) log p) local memory instead of O((n#p) log n)
An Architecture for Exploiting CoarseGrain Parallelism on FPGAs
"... Abstract—We propose the use of a novel architecture, called the MultiLevel Computing Architecture (MLCA) to efficiently exploit coarsegrain parallelism on FPGAs. The central component of the MLCA is its Control Processor (CP), which is analogous to an outoforder scheduling unit of a superscalar ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—We propose the use of a novel architecture, called the MultiLevel Computing Architecture (MLCA) to efficiently exploit coarsegrain parallelism on FPGAs. The central component of the MLCA is its Control Processor (CP), which is analogous to an outoforder scheduling unit of a
CoarseGrained Parallelization of CellularAutomata Simulation Algorithms ⋆
"... Abstract. Simulating spatial dynamics in physics by Cellular Automata (CA) requires very large computation power, and, hence, CA simulation algorithms are to be implemented on multiprocessors. The preconceived opinion, that no much effort is required to obtain highly efficient coarse grained paralle ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Simulating spatial dynamics in physics by Cellular Automata (CA) requires very large computation power, and, hence, CA simulation algorithms are to be implemented on multiprocessors. The preconceived opinion, that no much effort is required to obtain highly efficient coarse grained
A Note On Coarse Grained Parallel Integer Sorting
 Parallel Processing Letters
, 1999
"... We observe that for n=p p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting p relations and 18 prelations), O(n=p) memory per processor and O(n=p) local computation. Experimental data indicates that the algorithm ha ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We observe that for n=p p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting p relations and 18 prelations), O(n=p) memory per processor and O(n=p) local computation. Experimental data indicates that the algorithm
Results 1  10
of
1,200