Sciweavers

82 search results - page 4 / 17
» How much parallelism is there in irregular applications
Sort
View
ICFP
2010
ACM
13 years 8 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
EUROPAR
2004
Springer
14 years 9 days ago
A Generic Parallel Pattern-Based System for Bioinformatics
Abstract. Parallel program design patterns provide users a new way to get parallel programs without much effort. However, it is always a serious limitation for most existing parall...
Weiguo Liu, Bertil Schmidt
SC
2004
ACM
14 years 10 days ago
Performance Evaluation of Task Pools Based on Hardware Synchronization
A task-based execution provides a universal approach to dynamic load balancing for irregular applications. Tasks are arbitrary units of work that are created dynamically at runtim...
Ralf Hoffmann, Matthias Korch, Thomas Rauber
CLUSTER
2006
IEEE
14 years 29 days ago
A Hybrid MPI Simulator
Collective MPI operations are an interesting research topic, since their implementation is complex and there are many different possible ways to improve their performance. It is no...
Rolf Riesen
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie