Sciweavers

354 search results - page 35 / 71
» Memory and compiler optimizations for low-power and -energy
Sort
View
MICRO
2000
IEEE
98views Hardware» more  MICRO 2000»
15 years 10 months ago
The store-load address table and speculative register promotion
Register promotion is an optimization that allocates a value to a register for a region of its lifetime where it is provably not aliased. Conventional compiler analysis cannot alw...
Matt Postiff, David Greene, Trevor N. Mudge
GLVLSI
2008
IEEE
112views VLSI» more  GLVLSI 2008»
16 years 17 days ago
Instruction cache leakage reduction by changing register operands and using asymmetric sram cells
Share of leakage in cache memories is increasing with technology scaling. Studies show that most stored bits in instruction caches are zero, and hence, asymmetric SRAM cells which...
Maziar Goudarzi, Tohru Ishihara
IASTEDSEA
2004
15 years 7 months ago
Java bytecode verification with dynamic structures
Java applets run on a Virtual Machine that checks code's integrity and correctness before execution using a module called Bytecode Verifier. Java Card technology allows Java ...
Cinzia Bernardeschi, Luca Martini, Paolo Masci
PLDI
2006
ACM
16 years 2 days ago
Optimizing data permutations for SIMD devices
The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficul...
Gang Ren, Peng Wu, David A. Padua
ICLP
1993
Springer
15 years 10 months ago
On Copy Avoidance in Single Assignment Languages
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...
Saumya K. Debray