Optimal segmentation points for programs

Authors:
Brian W. Kernighan
Affiliations:
Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey
Venue:
SOSP '69 Proceedings of the second symposium on Operating systems principles
Year:
1969

Citing 2
Cited 2

One way of estimating frequencies of jumps in a program

Communications of the ACM
Dynamic Programming

Dynamic Programming

Virtual Memory

ACM Computing Surveys (CSUR)
Virtual storage and virtual machine concepts

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A program may be modeled as a directed graph on n " nodes, " where the nodes are instructions, or data items, or contiguous groups of these. This paper discusses the problem of partitioning such sets of nodes into pages to minimize the number of transitions between pages during execution of the program.The node's are assumed to have a given ordering which may not be changed. We require that nodes on any page must be contiguous, so the only degree of freedom is in selecting "break points" between the pages.We show that if the expected number of transitions between each node of the program graph and its successors is known, then there is an algorithm for selecting the optima break points. The algorithm requires an execution time which grows linearly with the number of nodes in almost all cases.