Measurement and Improvement of Program Behavior under Paging Systems

Publisher Summary This chapter discusses the measurement and improvement of program behavior under paging systems. It defines the parameters of importance that govern the performance of a paging system as well as the measurements needed to monitor the behavior of programs. It also discusses the tool implemented to make these measurements available, namely, Washington Interpretive Paging System (WIPS). WIPS is divided into three main modules: the CPU, the memory manager, and the CAL Interpreter. A possible option in the use of WIPS is the recording on tape of all memory references as well as the type of operation, instruction or data fetch, which caused that reference. The chapter further presents the results of the experiments on different versions of users' programs and presents the way simple changes in a program can yield interesting improvements in its behavior while running under a paging system.

[1]  A. C. McKellar,et al.  The organization of matrices and matrix operations in a paged multiprogramming environment , 1968 .

[2]  D. J. Howarth,et al.  Paging studies made on the I.C.T. Atlas , 1968, IFIP Congress.

[3]  I. F. Freibergs,et al.  The dynamic behavior of programs , 1968, AFIPS '68 (Fall, part II).

[4]  Daniel G. Bobrow,et al.  Structure of a LISP system using two-level storage , 1967, CACM.

[5]  Francis F. Lee,et al.  Study of "Look-Aside" Memory , 1969, IEEE Transactions on Computers.

[6]  M. Joseph,et al.  An Analysis of Paging and Program Behaviour , 1970, Computer/law journal.

[7]  Wilhelm Anacker,et al.  Performance Evaluation of Computing Systems with Memory Hierarchies , 1967, IEEE Trans. Electron. Comput..

[8]  Barbara S. Brawn,et al.  Program behavior in a paging environment , 1899, AFIPS '68 (Fall, part II).

[9]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[10]  Calvin C. Gotlieb,et al.  A List Structure Form of Grammars for Syntactic Analysis , 1970, CSUR.

[11]  Edward G. Coffman,et al.  Further experimental data on the behavior of programs in a paging environment , 1968, CACM.

[12]  Jacques Cohen,et al.  A use of fast and slow memories in list-processing languages , 1967, CACM.

[13]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[14]  Barbara S. Brawn,et al.  Sorting in a paging environment , 1970, Commun. ACM.

[15]  Edward G. Coffman,et al.  Organizing matrices and matrix operations for paged memory systems , 1969, Commun. ACM.

[16]  D. Sayre,et al.  Is automatic “folding” of programs efficient enough to displace manual? , 1969, CACM.