Abstract
Numerical software written in high-level languages often relies on machine-dependent parameters to improve portability. MACHAR is an evolving FORTRAN subroutine for dynamically determining thirteen fundamental parameters associated with a floating-point arithmetic system. The version presented here operates correctly on a large number of different floating-point systems, including those implementing the new IEEE Floating-Point Standard.
Supplemental Material
Available for Download
dynamically determine machine parameters Gams: R1
- 1 CODY, W. J., AND WAITE, W. Software Manual for the Elementary Functions. Prentice-Hall, Englewood Cliffs, N.J., 1980. Google Scholar
- 2 Fox, P. A., HALL, A. D., AND SCHRYER, N.L. Algorithm 528: Framework for a portable library. ACM Trans. on Math. Soft. 4 (1978), 177-188. Google Scholar
- 3 GENTLEMAN, W. M., AND MAROVICH, S. B. More on algorithms that reveal properties of floating-point arithmetic. Commun. ACM 17 (1974), 276-277. Google Scholar
- 4 IEEE Standard for Binary Floating-Point Numbers. ANSI/IEEE Std 754-1985, IEEE, New York, 1985.Google Scholar
- 5 MALCOLM, M.A. Algorithms to reveal properties of floating-point arithmetic. Commun. A CM 15 (1972), 949-951. Google Scholar
Index Terms
- Algorithm 665: Machar: a subroutine to dynamically determined machine parameters
Recommendations
Compile-time meta-programming in a dynamically typed OO language
DLS '05: Proceedings of the 2005 symposium on Dynamic languagesCompile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages are capable of compile-time meta-programming, and of those that do many of ...
Subroutine interface primitives for ETC
Proceedings of the international symposium on Extensible languagesEfficient coding for subroutine interfaces often implies, especially for system programmers, the passing of arguments in hardware registers, rather than on a system stack. This is a problem in an extendible compiler that allocates registers for itself ...
List-based Monadic Computations for Dynamically Typed Languages
Dyla'14: Proceedings of the Workshop on Dynamic Languages and ApplicationsIn this paper we propose a flexible and elegant design for list-based monadic ("karmic") computations in dynamically typed languages. Our approach is applicable to any dynamically typed language that supports lists, maps and higher-order functions. The ...
Comments