Sciweavers

1415 search results - page 97 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
SPAA
1995
ACM
15 years 6 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
IEEEPACT
2009
IEEE
15 years 9 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar
ICPP
2005
IEEE
15 years 8 months ago
Incremental Parallelization Using Navigational Programming: A Case Study
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin L...
134
Voted
SIAMSC
2010
125views more  SIAMSC 2010»
15 years 28 days ago
A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic partial differential equations (PDEs) on octree based conforming finite elemen...
Rahul S. Sampath, George Biros
DATE
1999
IEEE
105views Hardware» more  DATE 1999»
15 years 6 months ago
Identification and Exploitation of Symmetries in DSP Algorithms
In many algorithms, particularly those in the DSP domain, certain forms of symmetry can be observed. To efficiently implement such algorithms, it is often possible to exploit thes...
C. A. J. van Eijk, E. T. A. F. Jacobs, Bart Mesman...