2703 search results - page 300 / 541 » Optimizing memory transactions |
152
click to vote
LCR
1998
Springer
15 years 8 months ago
1998
Springer
Programs accessing disk-resident arrays, called out-of-core programs, perform poorly in general due to an excessive number of I/O calls and insufficient help from compilers. In ord...
145
click to vote
EUROGP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
127
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
136
click to vote
CC
2009
Springer
15 years 11 months ago
2009
Springer
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...
152
click to vote
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...