Analysis of Graphs by Connectivity Considerations
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Markovian model of the university of Michigan executive system
Communications of the ACM
ACM '66 Proceedings of the 1966 21st national conference
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Communications of the ACM
A model highlighting the security of operating systems
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Two approaches for measuring the performance of time-sharing systems
SOSP '69 Proceedings of the second symposium on Operating systems principles
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
Automatic program segmentation based on Boolean connectivity
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
| Hi-index | 48.24 |
Directed graphs or their associated matrices are frequently used to represent the logical structure of sequences of computer instructions. Such techniques are used and, in addition, data references are represented in a nondirected model. The complete structural specification of a program is represented by a combined model. A transformation of the combined model yields a new model in which additional timing information is also contained. Analysis of these models prior to execution yields information valuable in determining segmentation of instructions and data for a time-shared environment, as well as for initial page loading; during execution, the analysis may be used for “look ahead” control of page turning.