ACM Home Page
Please provide us with feedback. Feedback
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Full text PdfPdf (501 KB)
Source
Communications of the ACM archive
Volume 13 ,  Issue 1  (January 1970) table of contents
Pages: 3 - 6  
Year of Publication: 1970
ISSN:0001-0782
Author
Thomas C. Lowe  Informatics Inc., Bethesda, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361953.361957
What is a DOI?

ABSTRACT

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 programs 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
 
6
PROSSER, R.T. Applications of Boolean matrices to the analysis of flow diagrams. Proc. Eastern Joint Comp. Conf., Vol. 16, Dec. 1959, Spartan Books, New York, pp. 133-138.
 
7
ROSENBLATT, DAVID. On the graphs and asymptotic forms of finite Boolean relation matrices and stochastic matrices. Naval Res. Logist. Quart. 4 (June 1967), 32-37.
 
8
LOWE, THOMAS C. An algorithm for rapid calculation of products of Boolean matrices. Software Age 2 (Mar. 1968), 36-37.

CITED BY  9