Storage Allocation in a Certain Iterative Process

A method of core storage allocation in a certain
iterative process is described and estimates 
of the machine time required are given.  The method is
applicable to iterative processes in which input 
data items once chosen are never again needed.  In this
method the input data is continuously relocated 
and the space made available apportioned to the output
tables when an overflow occurs.  Some important 
special cases are considered in which considerable simplification occurs.

CACM June, 1967

Abramowich, J.

CA670605 JB February 28, 1978  9:25 AM

1587	5	1587
1587	5	1587
1587	5	1587