• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 81,807
Next 10 →

AUTOMATIC COARSE-GRAINED PARALLELIZATION TECHNIQUES

by unknown authors
"... Abstract. We present a complete automatic coarse-grained 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 coarse-grained 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

Coarse-Grain Parallel Programming in Jade

by Monica S. Lam, Martin C. Rinard , 1991
"... This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time 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 coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time system use

Coarse Grained Parallel Graph Planarity Testing

by Edson Cáceres, Albert Chan, Frank Dehne, S.W. Song - 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

Coarse-Grain Parallel Computing Using the ISIS Toolkit

by Ralph Finch, Associate Member, Shao-kong Kao
"... Abstract: A coarse-grained parallel (distributed) computing application using the ISIS toolkit is described. The method should be applicable to any serial program suitable for coarse-grain parallelization. Criteria for parallelizing existing programs, factors which affect the speed of parallel progr ..."
Abstract - Add to MetaCart
Abstract: A coarse-grained parallel (distributed) computing application using the ISIS toolkit is described. The method should be applicable to any serial program suitable for coarse-grain parallelization. Criteria for parallelizing existing programs, factors which affect the speed of parallel

Exploiting Coarse-Grain Parallelism in the MPEG-2 Algorithm

by Eiji Iwata, Kunle Olukotun , 1998
"... As the demand for multimedia applications increases, the performance of algorithms such as MPEG-2 video compression on general-purpose microprocessors is becoming more important. In this paper, we propose a number of coarse-grained parallel implementations of MPEG-2 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 MPEG-2 video compression on general-purpose microprocessors is becoming more important. In this paper, we propose a number of coarse-grained parallel implementations of MPEG-2 decoding and encoding. We

Optimizing Queries for Coarse Grain Parallelism

by Sumit Ganguly, Weining Wang , 1993
"... We consider the problem of optimizing select-project-join 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 select-project-join 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

Coarse-Grained Parallel Geometric Search

by Albert Chan, Frank Dehne, Andrew Rau-chaplin - 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)

Coarse-Grained Parallelization of Cellular-Automata Simulation Algorithms ⋆

by Olga Bandman
"... 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

An Architecture for Exploiting Coarse-Grain Parallelism on FPGAs

by Davor Capalija, Tarek S. Abdelrahman
"... Abstract—We propose the use of a novel architecture, called the Multi-Level Computing Architecture (MLCA) to efficiently exploit coarse-grain parallelism on FPGAs. The central com-ponent of the MLCA is its Control Processor (CP), which is analogous to an out-of-order 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 Multi-Level Computing Architecture (MLCA) to efficiently exploit coarse-grain parallelism on FPGAs. The central com-ponent of the MLCA is its Control Processor (CP), which is analogous to an out-of-order scheduling unit of a

A Note On Coarse Grained Parallel Integer Sorting

by A. Chan, F. Dehne - 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 p-relations), 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 p-relations), O(n=p) memory per processor and O(n=p) local computation. Experimental data indicates that the algorithm
Next 10 →
Results 1 - 10 of 81,807
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University