Sciweavers

6 search results - page 1 / 2
» Eliminating Cycles in Weak Tables
Sort
View
JUCS
2008
117views more  JUCS 2008»
13 years 4 months ago
Eliminating Cycles in Weak Tables
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...
Alexandra Barros, Roberto Ierusalimschy
CODES
2004
IEEE
13 years 8 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
13 years 10 months ago
Optimizing recursive queries in SQL
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
Carlos Ordonez
PLDI
2003
ACM
13 years 10 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, ...
IEEEPACT
2007
IEEE
13 years 11 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson