This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Analysis of Some Problems in Managing Virtual Memory Systems with Fast Secondary Storage Devices
August 1988 (vol. 14 no. 8)
pp. 1176-1187

Some of the problems that are expected to be encountered in managing virtual memory systems using the newer-technology secondary storage devices are address. The difficulties that two proposed policies have in choosing the most economical program localities of reference to assign to primary memory are analyzed. K. Koh's (1981) criterion for examining the cyclic locality interval (CLI) hierarchy of a program and choosing the least-cost pathway is examined. Koh's criterion is designed for the case of a CLI containing a single inner CLI. The decision to descend the hierarchy is based on the cycle time of the outer CLI. If the outer CLI has two or more inner CLIs, it is possible for Koh's criterion to indicate that it is more economical to descend to one of the inner CLIs without that actually being the case. Choosing which CLI to descend to requires knowledge of its duration, and this is not generally available to the memory management system. An attempt to use Koh's criterion with the loop structure of a program in order to reduce space-time execution cost was not successful.

[1] M. Badel, E. Gelenbe, J. Lenfant, and D. Potier, "Adaptive optimization of a time sharing system's performance,"Proc. IEEE, vol. 63, pp. 958-965, June 1975.
[2] J. L. Baer and G. R. Sager, "Dynamic improvement of locality in virtual memory systems,"IEEE Trans. Software Eng., vol. SE-2, pp. 54-62, Mar. 1976.
[3] A. L. Barrese and S. D. Shapiro, "Structuring programs for efficient operation in virtual memory systems,"IEEE Trans. Software Eng., vol. SE-5, pp. 643-652, Nov. 1979.
[4] A. P. Batson, "Program behavior at the symbolic level,"Computer, vol. 9, pp. 21-26, Nov. 1976.
[5] A. P. Batson, D. W. E. Blatt, and J. P. Kearns, "Structure within locality intervals," inProc. 3rd Int. Symp. Modeling Perf. Eval., 1977, pp. 221-232.
[6] L. A. Belady, "A study of replacement algorithms for virtual storage computers,"IBM Syst. J., vol. 5, no. 2, pp. 78-101, 1966.
[7] L. A. Belady and C. J. Kuehner, "Dynamic space sharing in computer system,"Commun. ACM, vol. 12, pp. 282-288, May 1969.
[8] J. P. Buzen, "Fundamental operational laws of computer system performance,"Acta Inform., vol. 7, no. 2, pp. 167-182, 1976.
[9] R. W. Carr and J. L. Hennessy, "WSClock--A simple and effective algorithm for virtual memory management," inProc. ACM-SIGOPS 8th Symp. Oper. Syst. Principles, Dec. 1981, pp. 87-95.
[10] W. W. Chu and H. Opderbeck, "Program behavior and the page fault frequency replacement algorithm,"Computer, vol. 9, pp. 29-38, Nov. 1976.
[11] Control Data Corp.,Extended Semiconductor Memory Hardware Reference Manual, 1981.
[12] P. J. Courtois and H. Vantilborgh, "A decomposable model of program paging behavior,"Acta Inform., vol. 6, no. 3, pp. 251-276, 1976.
[13] P. J. Denning, "The working set model for program behavior,"Commun. ACM, vol. 11, no. 5, pp. 323-333, May 1968.
[14] P. J. Denning, "Virtual memory,"ACM Comput. Surveys, vol. 2, pp. 153-189, 1970.
[15] P. J. Denning, "On modeling program behavior," inProc. AFIPS SJCC, vol. 40, 1972, pp. 937-944.
[16] P. J. Denning, "Working sets past and present,"IEEE Trans. Software Eng., vol. 6, pp. 64-84, Jan. 1980.
[17] D. Ferrari, "Improving locality by critical working sets,"Commun. ACM, vol. 17, pp. 614-620, Nov. 1974.
[18] D. Ferrari, "Tailoring programs to models of program behavior,"IBM J. Res. Develop., pp. 244-251, May 1975.
[19] D. Ferrari, "The improvement of program behavior,"Computer, vol. 9, pp. 39-47, Nov. 1976.
[20] D. Ferrari, "VSWS: The variable-interval sampled working set policy,"IEEE Trans. Software Eng., vol. SE-9, pp. 299-305, May 1983.
[21] E. Gelenbe and A. Kurinckx, "Random injection control of multiprogramming in virtual memory,"IEEE Trans. Software Eng., vol. SE-4, pp. 2-17, Jan. 1978.
[22] E. Gelenbe, P. Tiberio, and J. C. A. Boekhorst, "Page size in demand paging systems,"Acta Inform., vol. 3, pp. 1-23, 1973. (Republished fromProc. 1st ACM SIGME Symp. Syst. Perf. Eval., Palo Alto, CA, Feb. 1973, pp. 1-12.)
[23] S. J. Hartley, "Improving the performance of programs in virtual memory systems," Ph.D. dissertation, Univ. Virginia, Charlottesville, May 1983.
[24] D. Hatfield and J. Gerald, "Program restructuring for virtual memory,"IBM Syst. J., vol. 10, no. 3, pp. 168-192, 1971.
[25] D. Hatfield and J. Gerald, "Locality: Working set, request string, distance function, and replacement stack," inStatistical Computer Performance Evaluation, W. Freibergcr, Ed. New York: Academic, 1972, pp. 407-422.
[26] K. C. Kahn, "Program behavior and load dependent system performance," Ph.D. dissertation, Dep. Comput. Sci., Purdue Univ., W. Lafayette, IN, Aug. 1976.
[27] J. P. Kearns, "The structure of locality intervals," Ph.D. dissertation, Univ. Virginia, Charlottesville, Dec. 1979.
[28] K. Koh, "The design and performance of future virtual memory systems using fast memory technologies," Ph.D. dissertation, Univ. Virginia, Charlottesville, Aug. 1981.
[29] A. W. Madison and A. P. Batson, "Characteristics of program localities,"Commun. ACM, vol. 19, pp. 285-294, May 1976.
[30] G. S. Shedler and C. Tung, "Locality in page reference strings,"SIAM J. Comput., vol. 1, pp. 218-241, Sept. 1972.
[31] J. R. Spirn and P. J. Denning, "Experiments with program locality," inProc. AFIPS FJCC, vol. 41, 1972, pp. 611-621.

Index Terms:
storage allocation; virtual memory; secondary storage; cyclic locality interval; least-cost pathway; memory management; loop structure; space-time execution cost; storage allocation; storage management; virtual storage
Citation:
S.J. Hartley, "An Analysis of Some Problems in Managing Virtual Memory Systems with Fast Secondary Storage Devices," IEEE Transactions on Software Engineering, vol. 14, no. 8, pp. 1176-1187, Aug. 1988, doi:10.1109/32.7627
Usage of this product signifies your acceptance of the Terms of Use.