201 search results - page 15 / 41 » Predicting locality phases for dynamic memory optimization |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
ISHPC
2000
Springer
15 years 1 months ago
2000
Springer
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
OOPSLA
2010
Springer
14 years 8 months ago
2010
Springer
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
BIBE
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures ...