Sciweavers

1628 search results - page 85 / 326
» Dynamically Adaptive Parallel Programs
Sort
View
CCGRID
2007
IEEE
15 years 8 months ago
Adaptive Performance Modeling on Hierarchical Grid Computing Environments
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
Wahid Nasri, Luiz Angelo Steffenel, Denis Trystram
POPL
1998
ACM
15 years 6 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
ICS
2007
Tsinghua U.
15 years 8 months ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger
NETWORKS
2008
15 years 2 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
129
Voted
CLUSTER
2001
IEEE
15 years 6 months ago
GulfStream - a System for Dynamic Topology Management in Multi-domain Server Farms
This paper describes GulfStream, a scalable distributed software system designed to address the problem of managing the network topology in a multi-domain server farm. In particul...
Sameh A. Fakhouri, Germán S. Goldszmidt, Mi...