December 1969 - Vol. 12 No. 12
Features
A case study in programming for parallel-processors
An affirmative partial answer is provided to the question of whether it is possible to program parallel-processor computing systems to efficiently decrease execution time…
Is automatic “folding” of programs efficient enough to displace manual?
The operation of “folding” a program into the available memory is discussed. Measurements by Brawn et al. and by Nelson on an automatic folding mechanism of…
Numerical analysis in a Ph.D. computer science program
Numerical Analysis is the study of methods and procedures used to obtain“approximate solutions” to mathematical problems. Much of the emphasis is on…
Advanced cryptographic techniques for computer
Cryptographic techniques which can be used to maintain the confidentiality of information processed by computers are dealt with. Special emphasis is paid to the unique…
Optimization of expressions in Fortran
A method of optimizing the computation of arithmetic and indexing expressions of a Fortran program is presented. The method is based on a linear analysis of the…
The downhill method is a numerical method for solving complex equations ƒ(z) = 0 on which the only restriction is that the function w = ƒ(z) must be analytical.…
Productivity of multiprogrammed computers—progress in developing an analytic prediction method
Multiprogramming as it is discussed here is a mode of computer operation in which two or more programs are concurrently in processor memory and proceeding, each using the…
A fast random number generator for IBM 360
Marsaglia and Bray [1] recommend incorporating two-line random number generators directly into FORTRAN programs. One of the advantages of this is the time saved in…
Presentation of alphameric characters for information processing
This proposed American National Standard has been accepted for publication by American National Standards Committee X3, Computers and Information Processing. In order…