Sciweavers

273 search results - page 23 / 55
» Improving program slicing with dynamic points-to data
Sort
View
IISWC
2006
IEEE
15 years 3 months ago
Load Instruction Characterization and Acceleration of the BioPerf Programs
The load instructions of some of the bioinformatics applications in the BioPerf suite possess interesting characteristics: only a few static loads cover almost the entire dynamic ...
Paruj Ratanaworabhan, Martin Burtscher
EUROPAR
1998
Springer
15 years 1 months ago
Performance Measurement of Interpreted Programs
Abstract. In an interpreted execution there is an interdependence between the interpreter's execution and the interpreted application's execution; the implementation of t...
Tia Newhall, Barton P. Miller
CF
2005
ACM
14 years 11 months ago
Dynamic loop pipelining in data-driven architectures
Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over micro...
João M. P. Cardoso
PLDI
2012
ACM
13 years 2 days ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
PEPM
1994
ACM
15 years 1 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...