April 1974 - Vol. 17 No. 4
Features
A simple linear model of demand paging performance
Predicting the performance of a proposed automatically managed multilevel memory system requires a model of the patterns by which programs refer to the information stored…
Computation of page fault probability from program transition diagram
An algorithm is given for calculating page fault probability in a virtual memory system operating under demand paging with various memory sizes and replacement rules. A…
Execution characteristics of programs in a page-on-demand system
h show the execution characteristics of two types of commonly used programs in a large-scale, time-shared computer system. A software monitoring facility built into the…
On Lion’s counter example for Gotlieb’s method for the construction of school timetables
The timetable problem is an essentially discrete problem. Although the discrete problem may have no feasible solution, there may exist a solution to the equivalent…
Copying list structures using bounded workspace
Two new algorithms are presented for list structure copying using bounded workspace. The first, of primarily theoretical interest, shows that without cell tag bits the…
Two methods for employing parallelism in tape-sorting are presented. Method A is the natural way to use parallelism. Method B is new. Both approximately achieve the goal…
An improved program-synthesizing algorithm and its correctness
An improved program-synthesizing algorithm based on the algorithm proposed by Waldinger and Lee in 1969 is given. In the old algorithm, the program-synthesizing problem…
Scalar- and planar-valued curve fitting using splines under tension
The spline under tension was introduced by Schweikert in an attempt to imitate cubic splines but avoid the spurious critical points they induce. The defining equations…