Norman Brenner
ABSTRACT
Our group at IBM Yorktown Research has written a number of tool programs for VLSI design, all in APL. Several crucial algorithms were speeded up by recoding them in Fortran and Assembler Language. For example, the algorithm for complementation of a Boolean expression (which can sometimes have thousands of terms in dozens of variables) is 5 times faster in Fortran than the best APL code I could write. The linking mechanism used from APL to outside languages is the experimental AP403 from IBM Heidelberg, though other similar auxiliary processors exist (e.g. the IUP AP999). Thus, each language, Fortran and APL, is used to its best advantage: Fortran for raw speed, and APL for interactiveness and ease of coding.
- 1.Calling PL/I or Fortran Subroutines Dynamically from VS APL, H. Eberle and H. Schmutz, with updates by Dick Dunbar, Heidelberg Scientific Center TR 77.11.007, or from Dick Dunbar.Google Scholar
- 2.APLSJR—VS APL Release 4, plus enhancements. Available from the editor, Dick Dunbar of the IBM San Jose Research Laboratory, VNET address DUNBAR at SJRLVMI.Google Scholar
- 3.VS APL System Extensions IUP (5796-AZT).Google Scholar
- 4."Fast Recursive Boolean Function Manipulation", R. K. Brayton, J. D. Cohen, G. D. Hachtel, B. M. Trager and D. Y. Y. Yun, IEEE ISCAS 1982.Google Scholar
Index Terms
- VLSI circuit design using APL with fortran subroutines
Recommendations
VLSI circuit design using APL with fortran subroutines
Our group at IBM Yorktown Research has written a number of tool programs for VLSI design, all in APL. Several crucial algorithms were speeded up by recoding them in Fortran and Assembler Language. For example, the algorithm for complementation of a ...
An APL/370 compiler and some performance comparisons with APL interpreter and FORTRAN
The experimental APL/370 E-compiler compiles a subset of APL which is large enough for most scientific and engineering uses, directly into 370 assembly code. The compiler does not require variable declarations. The front-end employs extensive type-shape ...
An APL/370 compiler and some performance comparisons with APL interpreter and FORTRAN
APL '86: Proceedings of the international conference on APLThe experimental APL/370 E-compiler compiles a subset of APL which is large enough for most scientific and engineering uses, directly into 370 assembly code. The compiler does not require variable declarations. The front-end employs extensive type-shape ...
Comments