Sciweavers

285 search results - page 31 / 57
» Using the Compiler to Improve Cache Replacement Decisions
Sort
View
184
Voted
POPL
2007
ACM
15 years 9 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
LCTRTS
2010
Springer
14 years 7 months ago
Compiler directed network-on-chip reliability enhancement for chip multiprocessors
Chip multiprocessors (CMPs) are expected to be the building blocks for future computer systems. While architecting these emerging CMPs is a challenging problem on its own, program...
Ozcan Ozturk, Mahmut T. Kandemir, Mary Jane Irwin,...
IWMM
1998
Springer
130views Hardware» more  IWMM 1998»
15 years 1 months ago
Comparing Mostly-Copying and Mark-Sweep Conservative Collection
Many high-level language compilers generate C code and then invoke a C compiler for code generation. To date, most of these compilers link the resulting code against a conservativ...
Frederick Smith, J. Gregory Morrisett
PLDI
2003
ACM
15 years 2 months ago
A compiler framework for speculative analysis and optimizations
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
Jin Lin, Tong Chen, Wei-Chung Hsu, Pen-Chung Yew, ...
PLDI
1995
ACM
15 years 1 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove