October 1973 - Vol. 16 No. 10
Features
Multiple terminals under user program control in a time-sharing environment
User-written programs on the Dartmouth Time-Sharing System can communicate with many remote terminals simultaneously and can control the interactions between these…
A model and stack implementation of multiple environments
Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated.…
General performance analysis of key-to-address transformation methods using an abstract file concept
This paper presents a new approach to the analysis of performance of the various key-to-address transformation methods. In this approach the keys in a file are assumed to…
A note on the confinement problem
onfining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the…
A class of dynamic memory allocation algorithms
A new dynamic memory allocation algorithm, the Fibonacci system, is introduced. This algorithm is similar to, but seems to have certain advantages over, the…
Using page residency to select the working set parameter
Denning's method for selecting the working set parameter, which uses interreference intervals, is examined. Several omissions in his model are noted, and new assumptions…
Control structures in Illiac IV Fortran
As part of an effort to design and implement a Fortran compiler on the ILLIAC IV, an extended Fortran, called IVTRAN, has been developed. This language provides a means…
Addendum to a multiple-precision division algorithm
In [1] Mifsud presented a generalized division algorithm for positive integral operands. The uniqueness of the method was advertised as causing each trial cipher in the…