Sciweavers

5 search results - page 1 / 1
» Using hpm-sampling to drive dynamic compilation
Sort
View
OOPSLA
2007
Springer
13 years 11 months ago
Using hpm-sampling to drive dynamic compilation
All high-performance production JVMs employ an adaptive strategy for program execution. Methods are first executed unoptimized and then an online profiling mechanism is used to ...
Dries Buytaert, Andy Georges, Michael Hind, Matthe...
IEEEPACT
2006
IEEE
13 years 11 months ago
Whole-program optimization of global variable layout
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
Nathaniel McIntosh, Sandya Mannarswamy, Robert Hun...
PLDI
2010
ACM
13 years 10 months ago
An analysis of the dynamic behavior of JavaScript programs
The JavaScript programming language is widely used for web programming and, increasingly, for general purpose computing. As such, improving the correctness, security and performan...
Gregor Richards, Sylvain Lebresne, Brian Burg, Jan...
OOPSLA
2004
Springer
13 years 10 months ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
ASM
2000
ASM
13 years 9 months ago
Report on a Practical Application of ASMs in Software Design
ASMs have been used at Siemens Corporate Technology to design a component in a software package called FALKO. Main purpose of FALKO is the construction and validation of timetables...
Egon Börger, Peter Päppinghaus, Joachim ...