Sciweavers

357 search results - page 61 / 72
» Optimizing programs with intended semantics
Sort
View
ICSM
2009
IEEE
14 years 2 months ago
Incremental call graph reanalysis for AspectJ software
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
Yu Lin, Sai Zhang, Jianjun Zhao
HPDC
2008
IEEE
14 years 2 months ago
Harmony: an execution model and runtime for heterogeneous many core systems
The emergence of heterogeneous many core architectures presents a unique opportunity for delivering order of magnitude performance increases to high performance applications by ma...
Gregory F. Diamos, Sudhakar Yalamanchili
CGO
2005
IEEE
14 years 1 months ago
Sentinel PRE: Hoisting beyond Exception Dependency with Dynamic Deoptimization
Many excepting instructions cannot be removed by existing Partial Redundancy Elimination (PRE) algorithms because the ordering constraints must be preserved between the excepting ...
Rei Odaira, Kei Hiraki
ICFP
1999
ACM
13 years 12 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
PODC
2010
ACM
13 years 11 months ago
Transactional predication: high-performance concurrent sets and maps for STM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...