Sciweavers

1392 search results - page 98 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
RTCSA
1999
IEEE
15 years 2 months ago
A Method to Improve the Estimated Worst-Case Performance of Data Caching
This paper presents a method for tight prediction of worst-case performance of data caches in highperformance real-time systems. Our approach is to distinguish between data struct...
Thomas Lundqvist, Per Stenström
NAR
2000
128views more  NAR 2000»
14 years 9 months ago
The IMB Jena Image Library of Biological Macromolecules
The IMB Jena Image Library of Biological Macromolecules (http://www.imb-jena.de/IMAGE.html ) is aimed at a better dissemination of information on three-dimensional biopolymer stru...
Jan Reichert, Andreas Jabs, Peter Slickers, Jü...
SAT
2004
Springer
85views Hardware» more  SAT 2004»
15 years 3 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
ICSE
2004
IEEE-ACM
15 years 10 months ago
An Empirical Comparison of Dynamic Impact Analysis Algorithms
Impact analysis -- determining the potential effects of changes on a software system -- plays an important role in software engineering tasks such as maintenance, regression testi...
Alessandro Orso, Taweesup Apiwattanapong, James La...
PLDI
2012
ACM
13 years 7 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 ...