Vivek Sarkar, Mauricio J. Serrano, and Barbara B. Simons. "Retargeting Optimized Code by Matching Tree Patterns in Directed Acyclic Graphs", Patent Application, submitted in December 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Optimization through the use of Automatic Runtime.. - Whaley (1999) (3 citations) (Correct)
.... system (BURS) 53] Unlike previous approaches [70] to partitioning DAGs for tree pattern matching, this approach considers partitioning in the presence of memory and exception dependences (as well as register true dependences) The partitioning algorithm also incorporates code duplication [129]. input LIR: DAG tree: input grammar (relevant rules) move r2=r0 not r3=r1 and r4=r2,r3 cmp r5=r4,0 if r5, LBL emitted instructions: andc. r4,r0,r1 bne LBL IF CMP AND MOVE r0 0 NOT RULE PATTERN COST 1 reg: REGISTER 0 2 reg: MOVE(reg) 0 3 reg: NOT(reg) 1 ....
Vivek Sarkar, Mauricio J. Serrano, and Barbara B. Simons. "Retargeting Optimized Code by Matching Tree Patterns in Directed Acyclic Graphs", Patent Application, submitted in December 1998.
Dependence Analysis for Java - Craig Chambers Igor (1999) (10 citations) Self-citation (Sarkar Serrano) (Correct)
No context found.
Vivek Sarkar, Mauricio J. Serrano, and Barbara B. Simons. "Retargeting Optimized Code by Matching Tree Patterns in Directed Acyclic Graphs", Patent Application, submitted in December 1998.
The Jalapeño Dynamic Optimizing Compiler for Java - Burke, Choi, Fink.. (1999) (47 citations) Self-citation (Sarkar Serrano) (Correct)
....an instruction that depends on the result of the test (such as getfield) 6. 3 BURS based Retargetable Code Generation In this section, we address the problem of using tree patternmatching systems to perform retargetable code generation after code optimization in the Jalape no Optimizing Compiler [33]. Our solution is based on partitioning a basic 6 The addition of load load memory dependences will be necessary to correctly support the Java memory model for multithreaded programs that contain data races. input LIR: DAG tree: input grammar (relevant rules) move r2=r0 not r3=r1 and r4=r2,r3 ....
Vivek Sarkar, Mauricio J. Serrano, and Barbara B. Simons. "Retargeting Optimized Code by Matching Tree Patterns in Directed Acyclic Graphs", Patent Application, submitted in December 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC