Optimizing ML with run-time code generation Export

@article{citeulike:4990903, abstract = {We describe the design and implementation of a compiler that automatically translates ordinary programs written in a subset of ML into code that generates native code at run time. Run-time code generation can make use of values and invariants that cannot be exploited at compile time, yielding code that is often superior to statically optimal code. But the cost of optimizing and generating code at run time can be prohibitive. We demonstrate how compile-time specialization can reduce the cost of run-time code generation by an order of magnitude without greatly affecting code quality. Several benchmark programs are examined, which exhibit an average cost of only six cycles per instruction generated at run time.}, address = {New York, NY, USA}, author = {Lee, Peter and Leone, Mark}, citeulike-article-id = {4990903}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=249069.231407}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/249069.231407}, doi = {10.1145/249069.231407}, issn = {0362-1340}, journal = {SIGPLAN Not.}, keywords = {compilers, jit}, number = {5}, pages = {137--148}, posted-at = {2009-06-27 18:56:09}, priority = {5}, publisher = {ACM}, title = {Optimizing ML with run-time code generation}, url = {http://dx.doi.org/10.1145/249069.231407}, volume = {31}, year = {1996} }

TY - JOUR ID - citeulike:4990903 L3 - citeulike-article-id:4990903 N2 - We describe the design and implementation of a compiler that automatically translates ordinary programs written in a subset of ML into code that generates native code at run time. Run-time code generation can make use of values and invariants that cannot be exploited at compile time, yielding code that is often superior to statically optimal code. But the cost of optimizing and generating code at run time can be prohibitive. We demonstrate how compile-time specialization can reduce the cost of run-time code generation by an order of magnitude without greatly affecting code quality. Several benchmark programs are examined, which exhibit an average cost of only six cycles per instruction generated at run time. IS - 5 JF - SIGPLAN Not. SN - 0362-1340 AD - New York, NY, USA EP - 148 TI - Optimizing ML with run-time code generation PB - ACM VL - 31 SP - 137 KW - compilers KW - jit AU - Lee, Peter AU - Leone, Mark PY - 1996/// UR - http://dx.doi.org/10.1145/249069.231407 ER -