Automatic segmentation of cyclic program structures based on connectivity and processor timing

Authors:
Thomas C. Lowe
Affiliations:
Informatics Inc., Bethesda, MA
Venue:
Communications of the ACM
Year:
1970

Citing 5
Cited 11

Analysis of Graphs by Connectivity Considerations

Journal of the ACM (JACM)
The Influence of Data Base Characteristics and Usage on Direct Access File Organization

Journal of the ACM (JACM)
Object code optimization

Communications of the ACM
Analysis of boolean program models for time-shared, paged environments

Communications of the ACM
The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers

ACM '66 Proceedings of the 1966 21st national conference

Static grouping of small objects to enhance performance of a paged virtual memory

ACM Transactions on Computer Systems (TOCS)
Compile-Time Program Restructuring in Multiprogrammed Virtual Memory Systems

IEEE Transactions on Software Engineering
Improving locality by critical working sets

Communications of the ACM
Bibliography on paging and related topics

ACM SIGOPS Operating Systems Review
Applying program restructuring to dataflow environments

SAC '86 Proceedings of the 1986 workshop on Applied computing
A critical overview of computer performance evaluation

ICSE '76 Proceedings of the 2nd international conference on Software engineering
Profile-directed restructuring of operating system code

IBM Systems Journal
Dynamic Characteristics of Loops

IEEE Transactions on Computers
Analysis of an Information System Model with Transfer Penalties

IEEE Transactions on Computers
A methodology for the design and optimization of information processing systems

AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Segmentation and optimization of programs from cyclic structure analysis

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Quantified Score

Hi-index	48.24

Visualization

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.