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...
详细信息
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.
A set of logic operators, first proposed by Roth [3], based on an algebraic topological interpretation of a function table, have provided the basis for the subsequent development of algorithms for the computer aided s...
详细信息
A set of logic operators, first proposed by Roth [3], based on an algebraic topological interpretation of a function table, have provided the basis for the subsequent development of algorithms for the computer aided synthesis of combinatorial networks.
暂无评论