Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
This paper contrasts two very different strategies for improving the execution time performance of very high level language programs. An APL compiler has been developed which has two backends, one which produces IBM S/370 assembly code (APL/370) and one which produces C source code (APL/C). The result of each compilation path is compared for a large selection of APL benchmark programs. The results indicate that the efficient implementation of canned low level primitive routines can be a very effective optimization strategy for very high level languages. © 1993.
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science