Author:
Eckstein Erik,König Oliver,Scholz Bernhard
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Biswas, S., Balachandran, A., Dhamdhere, D.M.: Efficient retargetable code generation using bottom-up tree pattern matching. Computer Languages 15(3), 127–140 (1990)
2. Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: An efficient method of computing static single assignment form. In: ACM (ed.) POPL1989. Proceedings of the 16th annual ACM symposium on Principles of programming languages, Austin, TX, pp. 25–35. ACM Press, New York (1989)
3. Eckstein, E., Scholz, B.: Address mode selection. In: Proceedings of the International Symposium of Code Generation and Optimization (CGO 2003), San Francisco, March 2003. IEEE/ACM (2003)
4. Anton Ertl, M.: Optimal code selection in DAGs. In: Principles of Programming Languages (POPL 1999) (1999)
5. Fraser, C., Henry, R., Proebsting, T.: BURG – fast optimal instruction selection and tree parsing. ACM SIGPLAN Notices 27(4), 68–76 (1992)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Instruction Code Selection;SSA-based Compiler Design;2021-06-12
2. Optimization based on LLVM global instruction selection;Journal of Physics: Conference Series;2021-04-01
3. DYNAMAP;The 2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays;2021-02-17
4. Efficient Dynamic Device Placement for Deep Neural Network Training on Heterogeneous Systems;Lecture Notes in Computer Science;2019
5. Compiling for VLIW DSPs;Handbook of Signal Processing Systems;2018-10-14