Anthony Ralston
Pages 179-180

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 in the memory. Some recent experimental measurements on … Jerome H. Saltzer
Pages 181-186

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 first order Markov model of program behavior is assumed, … M. A. Franklin, R. K. Gupta
Pages 186-191

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 supervisor was used for data collection during normal system … John W. Boyse
Pages 192-196

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 continuous problem. An example, is given, for which the nondiscrete … Graham Smith, Ian M. Sefton
Pages 196-197

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 task can be performed in time n2. The second algorithm, assuming … Gary Lindstrom
Pages 198-202

Parallelism in tape-sorting

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 of reducing the processing time by a divisor which is the … Shimon Even
Pages 202-204

A study of computer use in a graduate school of business

Henry C. Lucas, David B. Montgomery, Jean Claude Larreche
Pages 205-206

Graduate education: The Ph.D. glut: response and rebuttal

Peter Freeman, Michael A. Malcolm, William H. Payne
Pages 206-207

Addendum to M.L. Patrick paper

Grover C. Simmons
Page 209

Some remarks on lookup of structured variables

Paul W. Abraham
Pages 209-210

An alternative approach to mutual recursion in Algol 60 using restricted compilers

A. Balfour
Page 210

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 is translated into a theorem-proving problem, and a program … R. C. T. Lee, R. J. Waldinger, C. L. Chang
Pages 211-217

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 are presented here, together with an efficient method for … A. K. Cline
Pages 218-220

Communications of the ACM

Table of Contents

ACM President's Letter: barely started business