Sciweavers

193 search results - page 16 / 39
» Automatic Parallelization and Optimization of Programs by Pr...
Sort
View
EUROPAR
2007
Springer
13 years 11 months ago
Optimizing Chip Multiprocessor Work Distribution Using Dynamic Compilation
How can sequential applications benefit from the ubiquitous next generation of chip multiprocessors (CMP)? Part of the answer may be a dynamic execution environment that automatica...
Jisheng Zhao, Matthew Horsnell, Ian Rogers, Andrew...
CSUR
1999
114views more  CSUR 1999»
13 years 7 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
HPCC
2007
Springer
13 years 11 months ago
Checkpointing Aided Parallel Execution Model and Analysis
Abstract. Checkpointing techniques are usually used to secure the execution of sequential and parallel programs. However, they can also be used in order to generate automatically a...
Laura Mereuta, Éric Renault
OOPSLA
2010
Springer
13 years 6 months ago
Parallel inclusion-based points-to analysis
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
Mario Méndez-Lojo, Augustine Mathew, Keshav...
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 8 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee