Sciweavers

1392 search results - page 31 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
PLDI
2010
ACM
15 years 2 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
EMSOFT
2004
Springer
15 years 3 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
COMPGEOM
2005
ACM
14 years 11 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
POS
2000
Springer
15 years 1 months ago
A Framework for Persistence-Enabled Optimization of Java Object Stores
Abstract. Aggressive optimization of programs often relies on analysis and transformation that cuts across the natural abstraction boundaries of the source programming language, su...
David Whitlock, Antony L. Hosking
ECOOP
2001
Springer
15 years 2 months ago
Precise Constraint-Based Type Inference for Java
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
Tiejun Wang, Scott F. Smith