Automatic Segmentation of Cyclic Program Structures
Based on Connectivity and Processor Timing

Time-shared, multiprogrammed, and overlayed batch systems frequently
require segmentation of computer programs into discrete portions.  
These program portions are transferred between executable and
peripheral storage whenever necessary; segmentation of program
s in a manner that  reduces the frequency of such transfers is the
subject of this paper.  Segmentation techniques proposed by C. V.
Ramamoorthy are subject to limitations that arise when the preferred
segment size is not compatible with the physical restrictions
imposed by the available computing equipment.  A generalization of
Ramamoorthy's suggestions is made in order to allow their application 
when circumstances are other than ideal.

CACM January, 1970

Lowe, T. C.

automatic segmentation, cyclic program structures, loops, paging, 
multiprogramming, loaders, assemblers, compilers, time-sharing, program 
connectivity

4.19 5.24 5.32

CA700101 JB February 14, 1978, 2:20 PM

2130	4	2130
1916	5	2130
2130	5	2130
2130	5	2130
2130	5	2130
2582	5	2130
1751	6	2130
1924	6	2130
2017	6	2130
2130	6	2130