PLDI
2004
ACM
14 years 25 days ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...