Sciweavers

321 search results - page 31 / 65
» OPTVIEW: A New Approach for Examining Optimized Code
Sort
View
ICA
2010
Springer
13 years 9 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
CGO
2006
IEEE
14 years 2 months ago
Region Monitoring for Local Phase Detection in Dynamic Optimization Systems
Dynamic optimization relies on phase detection for two important functions (1) To detect change in code working set and (2) To detect change in performance characteristics that ca...
Abhinav Das, Jiwei Lu, Wei-Chung Hsu
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
14 years 2 months ago
Optimized interval splitting in a linear scan register allocator
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems’ Java HotSpotTM client compiler. Linear scan register allocation is ...
Christian Wimmer, Hanspeter Mössenböck
LCTRTS
2010
Springer
13 years 6 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
PLDI
2006
ACM
14 years 2 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...