2703 search results - page 386 / 541 » Optimizing memory transactions |
105
Voted
PLDI
2000
ACM
15 years 8 months ago
2000
ACM
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
194
Voted
PLDI
1999
ACM
15 years 8 months ago
1999
ACM
This paper explores compiler techniques for reducing the memory needed to load and run program executables. In embedded systems, where economic incentives to reduce both ram and r...
132
Voted
PLDI
1996
ACM
15 years 7 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
121
click to vote
FOCS
1989
IEEE
15 years 7 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
131
Voted
FPGA
2006
ACM
15 years 7 months ago
2006
ACM
The paper presents several improvements to state-of-theart in FPGA technology mapping exemplified by a recent advanced technology mapper DAOmap [Chen and Cong, ICCAD `04]. Improve...