Sciweavers

291 search results - page 6 / 59
» A Parallel BSP Algorithm for Irregular Dynamic Programming
Sort
View
PPOPP
2010
ACM
14 years 6 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...
POPL
2009
ACM
14 years 3 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
IPPS
2009
IEEE
14 years 3 months ago
Dynamic parallelization for RNA structure comparison
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
Eric Snow, Eric Aubanel, Patricia Evans
CF
2006
ACM
14 years 2 months ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
IPPS
2010
IEEE
13 years 6 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha