Sciweavers

1628 search results - page 21 / 326
» Dynamically Adaptive Parallel Programs
Sort
View
PPOPP
2010
ACM
14 years 6 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
CLUSTER
2003
IEEE
14 years 2 months ago
Parallel Design Pattern for Computational Biology and Scientific Computing Applications
Dynamic programming is an important algorithm design technique in computational biology and scientific computing. Typical applications using this technique are very compute-intens...
Weiguo Liu, Bertil Schmidt
ISHPC
2000
Springer
14 years 1 months ago
Automatic Generation of OpenMP Directives and Its Application to Computational Fluid Dynamics Codes
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technolo...
Haoqiang Jin, Michael A. Frumkin, Jerry C. Yan
ISCA
1993
IEEE
153views Hardware» more  ISCA 1993»
14 years 1 months ago
An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing
Parallel programs that use critical sections and are executed on a shared-memory multiprocessor with a writeinvalidate protocol result in invalidation actions that could be elimin...
Per Stenström, Mats Brorsson, Lars Sandberg
ICDCSW
2006
IEEE
14 years 3 months ago
Concurrency Tradeoffs in Dynamic Adaptation
Software systems need to adapt as requirements change, environment conditions vary, and bugs are discovered and fixed. In context of verification of these adaptive systems, the ...
Karun N. Biyani, Sandeep S. Kulkarni