Sciweavers

3228 search results - page 44 / 646
» Basics of Compiler Design
Sort
View
LCTRTS
1998
Springer
15 years 1 months ago
Non-local Instruction Scheduling with Limited Code Growth
Instruction scheduling is a necessary step in compiling for many modern microprocessors. Traditionally, global instruction scheduling techniques have outperformed local techniques....
Keith D. Cooper, Philip J. Schielke
JUCS
2006
87views more  JUCS 2006»
14 years 9 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
ICFP
2004
ACM
15 years 9 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
ERSA
2006
129views Hardware» more  ERSA 2006»
14 years 11 months ago
Group-Alignment based Accurate Floating-Point Summation on FPGAs
Floating-point summation is one of the most important operations in scientific/numerical computing applications and also a basic subroutine (SUM) in BLAS (Basic Linear Algebra Sub...
Chuan He, Guan Qin, Mi Lu, Wei Zhao
ML
2008
ACM
135views Machine Learning» more  ML 2008»
14 years 9 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget