Sciweavers

1178 search results - page 19 / 236
» Static and Dynamic Evaluation of Data Dependence Analysis
Sort
View
IPPS
1996
IEEE
14 years 24 days ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
IWPC
2006
IEEE
14 years 2 months ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge
PDPTA
1996
13 years 10 months ago
Evaluation of Dynamic Data Distributions on NUMA Shared Memory Multiprocessors
Dynamic data distributions offer a number of performance benefits, but require more sophisticated compiler support and incur run-time overhead. We investigate attainable benefits ...
Tarek S. Abdelrahman, Kenneth L. Ma
PEPM
1993
ACM
14 years 22 days ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
SAC
2009
ACM
14 years 3 months ago
Evaluating algorithms that learn from data streams
In the past years, the theory and practice of machine learning and data mining have been focused on static and finite data sets from where learning algorithms generate a static m...
João Gama, Pedro Pereira Rodrigues, Raquel ...