1

A. M. Abd-Alla, "Optimal Page Size for Multi-Programmed Computer Systems", Proc. Fifth Princeton Conf. on Info. Sci. and Sys., pp. 116--120, 1971.

2

ACM, "Proceedings of a Symposium on Storage Allocation", CACM, 4, 10, October, 1961.

3

A. K. Agrawala and R. M. Bryant, "Models of Memory Scheduling", Computer science Tech. Rpt. TR-392, July, 1975, University of Maryland.

4

Alfred V. Aho , Peter J. Denning , Jeffrey D. Ullman, Principles of Optimal Page Replacement, Journal of the ACM (JACM), v.18 n.1, p.80-93, Jan. 1971  [doi>10.1145/321623.321632]

5

A. Alderson, W. C. Lynch and B. Randell. "Thrashing in a Multiprogrammed Paging System", from Operating Systems Techniques, ed. Hoare and Perrott, Academic Press, 1968, pp. 152--167.

6

R. C. Allen , S. R. Clark, A note on an empirical study of paging on an IBM 370/145, ACM SIGMETRICS Performance Evaluation Review, v.6 n.1, p.55-62, Winter 1977  [doi>10.1145/1044829.1044832]

7

W. Anacker and C. P. Wang, "Performance Evaluation of Computing Systems with Memory Hierarchies", IEEETEC, EC-16, 6, December, 1967, pp. 764--773.

8

H. A. Anderson Jr., "Least Likely to be Serviced Page Replacement Algorithm", IBM Tech. Disc. Bull., 18, 7, December, 1975, pp. 2378--2380.

9

M. Arato. "A Note on Optimal Performance Page Storage", Acta Cybernetica, 3, I, 1976, pp. 25--30.

10

R. F. Arnold, M. H. Hartung and F. D. Snow, "Adaptive Time Stamp Mechanism", IBM Tech. Disc. Bull., 16, 7, December, 1973, pp. 2209--2213.

11

Radha Krishnan Arora and R. K. Subramanian, "Exploiting the Optimal Paging Algorithms", Info. Proc. Letters, 7, 5, August, 1978, pp. 233--236.

12

ARVIND, Models for the comparison of memory management algorithms., 1973

13

Arvind , R. Y. Kain , E. Sadeh, On reference string generation processes, ACM SIGOPS Operating Systems Review, v.7 n.4, p.80-87, October 1973

14

C. R. Attanasio, "Hardware Assist to Management of Dynamically Allocated Working Storage", IBM Tech. Disc. Bull., 20, 4, September, 1977, pp. 1651--1652.

15

Oleg Aven, Leonid Boguslavsky and Yakov Kogan, "Some Results on Distribution Free Analysis of Paging Algorithms", IEEETC, C-25, 7, July, 1976, pp. 737--745.

16

J. Y. Babonneau , M. S. Achard , G. Morisset , M. B. Mounajjed, Automatic and general solution to the adaptation of programs in a paging environment, Proceedings of the sixth ACM symposium on Operating systems principles, p.109-116, November 16-18, 1977, West Lafayette, Indiana, United States

17

M. Badel, E. Gelenbe, J. Lenfant, J. Leroudier and D. Potier, "Adaptive Optimization of the Performance of a Virtual Memory Computer", from Computer Architectures and Networks, ed. Gelenbe and Mahl. North Holland, 1974, pp. 1--25, republished, Proc. IEEE, 63, 6, June, 1975, pp. 958--965.

18

J. L. Baer and G. R. Sager, "Measurement and Improvement of Program Behavior under Paging Systems", from Statistical Computer Performance Evaluation, ed. Freiberger, Academic Press, 1972, pp. 241--264.

19

Jean-Loup Baer and Gary Sager, "Dynamic Improvement of Locality in Virtual Memory Systems, IEEETSE, SE-2, I, March, 1976, pp. 54--62.

20

Y. Bard. "Experimental Evaluation of System Performance", IBM Sys. J., 12, 3, 1973, pp. 302--315.

21

Y. Bard, "Characterization of Program Paging in a Time Sharing Environment", IBM J. Res. and Devel. 17, 5, September, 1973, pp. 387--393.

22

Y. Bard. "Application of the Page Survival Index (PSI) to Virtual Memory System Performance", IBM J. Res. and Devel., 19, 3, May, 1975, pp. 212--220.

23

Y. Bard, "Performance Analysis of Virtual Memory Time Sharing Systems", IBM Sys. J., 14, 4, 1975, pp. 366--384.

24

Albin L. Vareha , Ronald M. Rutledge , Michael M. Gold, Strategies for structuring two level memories in a paging environment, Proceedings of the second symposium on Operating systems principles, October 20-22, 1969, Princeton, New Jersey  [doi>10.1145/961053.961075]

25

Forest Baskett , Abbas Rafii, The A0 inversion model of program paging behavior, Stanford University, Stanford, CA, 1976

26

Alan Batson. "Program Behavior at the Symbolic Level", Computer, 9, 11, November, 1976, pp. 21--26.

27

Alan P. Batson , D. W. E. Blatt , John P. Kearns, Structure within Locality Intervals, Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems, p.221-232, October 03-05, 1977

28

A. P. Batson , R. E. Brundage, Measurements of the virtual memory demands of Algol-60 programs (Extended Abstract), Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation, p.121-126, January 1974

29

Alan Batson , Shy-Ming Ju , David C. Wood, Measurements of segment size, Communications of the ACM, v.13 n.3, p.155-159, March 1970  [doi>10.1145/362052.362055]

30

A. P. Batson , A. W. Madison, Measurements of major locality phases in symbolic reference strings, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.75-84, March 29-31, 1976, Cambridge, Massachusetts, United States  [doi>10.1145/800200.806184]

31

M. H. J. Baylis, D. G. Fletcher and D. J. Howarth. "Paging Studies made on the I. C. T. Atlas Computer", Proc. IFIP Congress 1968, Edinburgh, pp. D113-D118.

32

L. A. Belady, "A Study of Replacement Algorithms for a Virtual Storage Computer", IBM Systems J., 5, 2, 1966, pp. 75--101.

33

L. A. Belady, "Biased Replacement Algorithms for Multiprogramming", IBM Research Report NC 697, March, 1967.

34

L. A. Belady , C. J. Kuehner, Dynamic space-sharing in computer systems, Communications of the ACM, v.12 n.5, p.282-288, May 1969  [doi>10.1145/362946.363002]

35

L. A. Belady , R. A. Nelson , G. S. Shedler, An anomaly in space-time characteristics of certain programs running in a paging machine, Communications of the ACM, v.12 n.6, p.349-353, June 1969  [doi>10.1145/363011.363155]

36

L. A. Belady and F. P. Palermo, "On Line Measurement of Paging Behavior by the Multi-Valued MIN Algorithm", IBM J. Res. and Devel., 18, 1, January, 1974, pp. 2--19.

37

L. A. Belady and R. F. Tsao, "Memory Allocation and Program Behavior Under Multiprogramming", in Proc. Comp. Sci. and Statistics: 7'th Annual Symp. on the Interface, October, 1973, pp. 72--78.

38

B. T. Bennett and V. J. Kruskal, "LRU Stack Processing", IBM J. Res. and Devel., 19, 4, July, 1975, pp. 353--357.

39

A. Bensoussan , C. T. Clingen , R. C. Daley, The Multics virtual memory: concepts and design, Communications of the ACM, v.15 n.5, p.308-318, May 1972  [doi>10.1145/355602.361306]

40

Roberto Bisiani "Paging Behavior of Knowledge Networks", Computer Science Report, August, 1977, Carnegie Mellon University.

41

J. K. Boggs, Jr. "Minimizing Input/Output Page Pinning in a Virtual Storage Data Processor", IBM Tech. Disc. Bull, 19, I, June, 1976, pp. 83--84.

42

Robert P. Bogott and Mark A. Franklin, "Evaluation of Markov Program Models in Virtual Memory Systems", Software - Practice and Experience, 5, 4, 1975, pp. 337--346.

43

M. Bouillot. "Computer Provided With Storage Expansion and Adapted for Processing Paged Programs", IBM Tech. Disc. Bull., 16, 10, March, 1974, pp. 3270--3271.

44

Daniel P. Bovet and Gerald Estrin, "A Dynamic Memory Allocation Algorithm", IEEETC, C-19, 5, May, 1970, pp. 403--411.

45

A. J. Bowen, "Real Memory Contention Control", IBM Tech. Disc. Bull., 17, 3, August, 1974, pp. 663--664.

46

A. J. Bowen, "Job Oriented Page Replacement", IBM Tech. Disc. Bull., 17, 3, August, 1974, pp. 665--657

47

John W. Boyse, Execution characteristics of programs in a page-on-demand system, Communications of the ACM, v.17 n.4, p.192-196, April 1974  [doi>10.1145/360924.360930]

48

A. Brandwajn. "A Model of a Time Sharing Virtual Memory System Solved Using Equivalence and Decomposition Methods", Acta Informatica, 4, 1974, pp. 11--47.

49

A. Brandwajn. "A Model of a Virtual Memory System", Acta Informatica, 6, 1976, pp. 365--386.

50

Alexandre Brandwajn, A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions, Journal of the ACM (JACM), v.24 n.2, p.222-240, April 1977  [doi>10.1145/322003.322007]

51

A. Brandwajn and B. Mouneix, "A Study of a Page on Demand System", Info. Proc. Letters, 6, 4, August, 1977, pp. 125--132.

52

Barbara S. Brawn and Frances Gustavson. "Program Behavior in a Paging Environment", Proc. FJCC, 1968, pp. 1019--1032.

53

Barbara S. Brawn , Frances G. Gustavson , Efrem S. Mankin, Sorting in a paging environment, Communications of the ACM, v.13 n.8, p.483-494, Aug. 1970  [doi>10.1145/362705.362710]

54

C. Bron, "Allocation of Virtual Store in the T.H.E. Multiprogramming System", from Operating Systems Techniques, ed. Hoare and Perrott, Academic Press, 1968, pp. 168--193.

55

R. M. Brown , J. C. Browne , K. M. Chandy, Memory management and response time, Communications of the ACM, v.20 n.3, p.153-165, March 1977  [doi>10.1145/359436.359443]

56

Peter Bryant, "Predicting Working Set Sizes", IBM J. Res. and Devel., 19, 3, May, 1975, pp. 221--229.

57

Patrice Burgevin, Philippe Ingels and Jacques Leroudier, "Analysis of Program Behavior", Research Report 237, June, 1977, IRIA.

58

Patrice Burgevin , Jacques Leroudier, Characteristics and models of program behaviour, Proceedings of the annual conference, p.344-350, October 20-22, 1976, Houston, Texas, United States  [doi>10.1145/800191.805613]

59

David S. Burris , Udo W. Pooch, The dynamic matrix model, Proceedings of the 1977 annual conference, p.386-391, January 1977  [doi>10.1145/800179.1124631]

60

Jeffrey Buzen, "Optimizing the Degree of Multiprogramming in Demand Paging Systems", Proc. 1971, IEEE Comp. Soc. Conf., September, 1971, Boston, Mass. pp. 139--140.

61

R. M. Callahan and A. B. Goldschmidt. "Functional Working Sets", IBM Tech. Disc. Bull., 19, 4, September, 1976, pp. 1363--1364.

62

R. G. Casey , I. Osman, Generalized page replacement algorithms in a relational data base, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.101-124, May 01-03, 1974, Ann Arbor, Michigan  [doi>10.1145/800296.811507]

63

R. G. Casey and I. Osman, "Replacement Algorithms for Storage Management and Relational Data Bases", The Computer J., 19, 4, November, 1976, pp. 306--314.

64

D. D. Chamberlin, S. H. Fuller and L. Y. Liu, "An Analysis of Page Allocation Strategies for Multiprogramming Systems With Virtual Memory", IBM J. Res. and Devel., 17, 5, September, 1973, pp. 404--412.

65

Willy. W. Chiu and We Min Chow. "A Hybrid Hierarchical Model of a Multiple Virtual Storage (MVS) Operating System", IBM Research Report RC 6947, January, 1978.

66

Willy Chiu and Leon Presser, "Fixed Vs. Dynamic Partitioning of Storage", IBM Research Report RC 4988, August, 1974.

67

Willy. W. Chiu and P. C. Yue. "Transient Adaptive Memory Allocation", IBM Tech. Disc. Bull., 20, 5, October, 1977, pp. 2074--2076.

68

We-Min Chow and Willy W. Chiu. "An Analysis of Swapping Policies in Virtual Storage Systems", IEEETSE, SE-3, 2, March, 1977, pp. 150--156.

69

We-Min Chow and Willy W. Chiu, "A Program Behavior Model for Paging Systems", IBM Research Report RC 6452, March, 1977, republished Proc. Int. Symp. Computer Performance Modeling, Measurement and Evaluation, Yorktown Heights, N.Y., August, 1977, pp. 363--380.

70

David M. Choy, "A Graphical Tool for the Evalution of Pre-Paging and of Paging with Non-Uniform Pages", IBM Research Rept. RJ-1789, May, 1976.

71

Wesley W. Chu, N. Oliver, and Holger Opderbeck, "Measurement Data on the Working Set Replacement Algorithms and Their Applications", Proc. Polytechnic Inst. of Brooklyn Symp. on Computer Communications and Teletraffic, April, 1972, pp. 113--124.

72

Wesley Chu and Holger Opderbeck, "The Page Fault Frequency Replacement Algorithm", Proc. FJCC, 1972, pp. 597--609.

73

Wesley W. Chu and Holger Opderbeck, "Performance of Replacement Algorithms with Different Page Sizes", Computer, 7, 11, November, 1974, pp. 14--21.

74

Wesley W. Chu , Holger Opderbeck, Analysis of the PFF replacement algorithm via a semi-Markov model, Communications of the ACM, v.19 n.5, p.298-304, May 1976  [doi>10.1145/360051.360234]

75

Wesley W. Chu and Holger Opderbeck, "Program Behavior and the Page Fault Frequency Replacement Algorithm, Computer, 9, 11, November, 1976, pp. 29--38.

76

N. R. Clark and N. K. Ouchi, "Adaptive Staging Mechanism in a Virtual Storage System", IBM Tech. Disc. Bull., 17, 1, June, 1974, pp. 210--214.

77

Edward G. Coffman, Jr. , Peter J. Denning, Operating Systems Theory, Prentice Hall Professional Technical Reference, 1973

78

E. G. Coffman and B. Randell, "Performance Predictions for Extended Paged Memories", Acta Informatica, 1, 1, 1971, pp. 1--13.

79

E. G. Coffman, Jr. , Thomas A. Ryan, Jr., A study of storage partitioning using a mathematical model of locality, Communications of the ACM, v.15 n.3, p.185-190, March 1972  [doi>10.1145/361268.361280]

80

E. G. Coffman , L. C. Varian, Further experimental data on the behavior of programs in a paging environment, Communications of the ACM, v.11 n.7, p.471-474, July 1968  [doi>10.1145/363397.363398]

81

George O. Collins, Jr., Experience in automatic storage allocation, Communications of the ACM, v.4 n.10, p.436-440, Oct. 1961  [doi>10.1145/366786.366802]

82

Lesin W. Comeau, A study of the effect of user program optimization in a paging system, Proceedings of the first ACM symposium on Operating System Principles, p.4.1-4.7, January 1967  [doi>10.1145/800001.811667]

83

F. J. Corbato, "A Paging Experiment with the Multics System", Project MAC Memo MAC-M-384, JuIy, 1968, Mass. Inst. of Tech., published in In Honor of P. M. Morse, ed. Ingard, MIT Press, 1969, pp. 217--228.

84

P. J. Courtois and H. Vantilborgh, "A Decomposable Model of Program Paging Behavior", Acta Informatica, 6, 1976, pp. 265--275.

85

Robert C. Daley , Jack B. Dennis, Virtual memory, processes, and sharing in MULTICS, Communications of the ACM, v.11 n.5, p.306-312, May 1968  [doi>10.1145/363095.363139]

86

W. M. De Meis , N. Weizer, Measurement and analysis of a demand paging Time Sharing System, Proceedings of the 1969 24th national conference, p.201-216, August 26-28, 1969  [doi>10.1145/800195.805933]

87

Peter J. Denning, "Memory Allocation in Multiprogrammed Computer Systems", MIT Project MAC Computation Structures Group Memo No. 24, March, 1966.

88

P. J. Denning, RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS, Massachusetts Institute of Technology, Cambridge, MA, 1968

89

Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968  [doi>10.1145/363095.363141]

90

Peter J. Denning. "Thrashing: It's Causes and Prevention", Proc. FJCC 1968, pp. 915--922.

91

Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970  [doi>10.1145/356571.356573]

92

Peter J. Denning, "On Modeling Program Behavior", Proc. SJCC, 1972, pp. 937--944.

93

Peter J. Denning, Third Generation Computer Systems, ACM Computing Surveys (CSUR), v.3 n.4, p.175-216, Dec. 1971  [doi>10.1145/356593.356595]

94

Peter J. Denning, Comments on a linear paging model, Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation, p.34-48, January 1974

95

Peter J. Denning. "The Computation and Use of Optimal Paging Curves", Computer Science Report CSD-TR-154, Purdue University, June, 1975.

96

Peter J. Denning. "Program Behavior, Working Sets, and Multiprogramming", Computer Science Report TR-194, June, 1976, Purdue University.

97

Peter J. Denning, "Working Sets Then and Now", Proc. Second International Symp. on Operating Systems, IRIA Laboria, 78150 Le Chesnay, France, October, 1978.

98

Peter J. Denning and John L. Bruno, "On the Management of Multilevel Memories", Comp. Sci. Tech. Rept. 76, Princeton University, Princeton, N. J., April, 1969.

99

Peter J. Denning , Jeffrey P. Buzen, The Operational Analysis of Queueing Network Models, ACM Computing Surveys (CSUR), v.10 n.3, p.225-261, Sept. 1978  [doi>10.1145/356733.356735]

100

Peter J. Denning. Y. C. Chen and G. S. Shedler, "A Model for Program Behavior Under Demand Paging", IBM Research Report RC-2301, December, 1968.

101

Peter J. Denning and G. Scott Graham, "Multiprogrammed Memory Management", Proc. IEEE, 63, 6, June, 1975, pp. 924--931.

102

Peter J. Denning , Kevin C. Kahn, An L=S criterion for optimal multiprogramming, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.219-229, March 29-31, 1976, Cambridge, Massachusetts, United States  [doi>10.1145/800200.806198]

103

Peter J. Denning , Kevin C. Kahn, A study of program locality and lifetime functions, Proceedings of the fifth ACM symposium on Operating systems principles, p.207-216, November 19-21, 1975, Austin, Texas, United States

104

P. J. Denning, K. C. Kahn, J. Leroudier, D. Potier, and R. Suri "Optimal Multiprogramming", Acta Informatica, 7, 2, 1976, pp. 197--216.

105

Peter J. Denning, John E. Savage and Jeffrey R. Spirn, "Models for Locality in Program Behavior". Technical Report 107, April, 1972, Princeton University, Dept. of Electrical Engineering.

106

Peter J. Denning , Stuart C. Schwartz, Properties of the working-set model, Communications of the ACM, v.15 n.3, p.191-198, March 1972  [doi>10.1145/361268.361281]

107

Peter J. Denning , Donald R. Slutz, Generalized working sets for segment reference strings, Communications of the ACM, v.21 n.9, p.750-759, Sept. 1978  [doi>10.1145/359588.359598]

108

Peter J. Denning and Jeffrey R. Spirn, Some Thoughts About Locality Program Behavior", Proc. Symp. on Computer Communications Networks Teletraffic, New York, 1972, Polytechnic Press, pp. 101--112.

109

Peter J. Denning , Jeffrey R. Spirn, Dynamic storage partitioning, Proceedings of the fourth ACM symposium on Operating system principles, p.73-79, January 1973

110

Peter J. Denning and Tran-Quoc-Te, "On the Optimality of Working Set Policies", Technical Report, May, 1976, Purdue University Computer Science Department.

111

R. W. Doran, "Virtual Memory", Computer, 9, 10, October, 1976, pp. 27--37.

112

M. C. Easton, "Model for Database Reference Strings Based on Behavior of Reference Clusters", IBM J. Res. and Devel., 22, 2, March, 1978, pp 197--202.

113

Malcolm C. Easton, "Computation of Cold Start Miss Ratios", IEEETC, C-27, 5, May, 1978, pp. 404--408.

114

M. C. Easton , B. T. Bennett, Transient-free working-set statistics, Communications of the ACM, v.20 n.2, p.93-99, Feb. 1977  [doi>10.1145/359423.359431]

115

Malcolm C. Easton and Ron Fagin, "Cold-start vs. Warm-start Miss Ratios and Multiprogramming Performance", IBM Research Report RC-5715, November, 1975.

116

M. C. Easton and P. A. Franaczek. "Use Bit Scanning in Replacement Decisions", IBM Research Report RC-6192, September, 1976.

117

Arno Endres and Hans-Georg Stork, "FIFO Optimal Placement on Pages of Independently Referenced Sectors", Info. Proc. Letters, 6, 2, April, 1977, pp. 46--49.

118

Ronald Fagin, A counterintuitive example of computer paging, Communications of the ACM, v.19 n.2, p.96-97, Feb. 1976  [doi>10.1145/359997.360012]

119

Ronald Fagin, "Asymptotic Miss Ratios Over Independent References", J. Comp. and Sys. Sci., 14, 2, 1977, pp. 222--250.

120

Ronald Fagin , Malcolm C. Easton, The independence of miss ratio on page size, Journal of the ACM (JACM), v.23 n.1, p.128-146, Jan. 1976  [doi>10.1145/321921.321935]

121

Ronald Fagin and Thomas G. Price, "Efficient Calculation of Expected Miss Ratios In The Independent Reference Model", IBM Research Report RJ-1849, October, 1976.

122

D. P. Fenton, "B6700 Working Set Memory Allocation", from Operating Systems Techniques, ed. Hoare and Perrott, Academic Press, 1968, pp. 351--334.

123

E. B. Fernandez, T. Lang and C. Wood, "Optimal Page Replacement Algorithm", IBM Tech. Disc. Bull., 20, 11, April, 1978, pp. 4587--4588.

124

E. B. Fernandez, T. Lang, and C. Wood. "Effect of Replacement Algorithms on a Paged Buffer Database System", IBM. J. Res. Devel., 22, 2, March, 1978, pp. 185--196.

125

Domenico Ferrari, A tool for automatic program restructuring, Proceedings of the annual conference, p.228-231, August 27-29, 1973, Atlanta, Georgia, United States  [doi>10.1145/800192.805709]

126

Domenico Ferrari, "Improving Program Locality by Strategy Oriented Restructuring", Proc. IFIP Conf., 1974, pp. 266--270.

127

Domenico Ferrari, "An Analytic Study of Memory Allocation in Multiprocessing Systems. Computer Architectures and Networks, ed. Gelenbe and Mahl, North Holland, 1974, pp. 141--154.

128

Domenico Ferrari, Improving locality by critical working sets, Communications of the ACM, v.17 n.11, p.614-620, Nov. 1974  [doi>10.1145/361179.361195]

129

Domenico Ferrari, "Tailoring Programs to Models of Program Behavior", IBM J. Res. and Devel., 19, 3, May, 1975, pp. 244--251.

130

Domenico Ferrari, "The Improvement of Program Behavior", Computer, 9, 11, November, 1976, pp. 39--47.

131

Domenico Ferrari, "An Approach to the Design of a Learning Memory Manager", Proc. 1977 SIGMETRICS/CMG VIII Conference on Computer Performance, Modeling, Measurement and Management, November, 1977, washington, D. C., pp. 217--224.

132

D. Ferrari and M. Kobayashi, "Program Restructuring Algorithms for Global LRU Environments", Proc. Int, Computing Symp., 1977, Liege, Belgium, April, 1977, pp. 277--283.

133

Domenico Ferrari , Edwin Lau, An experiment in program restructuring for performance enhancement, Proceedings of the 2nd international conference on Software engineering, p.146-150, October 13-15, 1976, San Francisco, California, United States

134

Gerald H. Fine , Calvin W. Jackson , Paul V. Mc Isaac, Dynamic program behavior under paging, Proceedings of the 1966 21st national conference, p.223-228, January 1966  [doi>10.1145/800256.810701]

135

Marc H. Fogel, The VMOS paging algorithm: a practical implementation of the working set model, ACM SIGOPS Operating Systems Review, v.8 n.1, p.8-17, January 1974  [doi>10.1145/775265.775267]

136

John Fotheringham, Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store, Communications of the ACM, v.4 n.10, p.435-436, Oct. 1961  [doi>10.1145/366786.366800]

137

Peter A. Franaszek, "An Algorithm for Computing MIN Fault Statistics", IBM Research Report RC-5291, February, 1975.

138

Peter A. Franaszek, "Effects of Program Modification in an LRU Hierarchy", IBM Research Report RC-5383, March, 1975.

139

Peter A. Franaszek and B. T. Bennett, "Adaptive Variation of the Transfer Unit in a Storage Hierarchy", IBM Research Report RC-6310 November, 1976, republished IBM J. Res. and Devel., 22, 4, July, 1978, pp. 405--412.

140

P. A. Franaszek , T. J. Wagner, Some Distribution-Free Aspects of Paging Algorithm Performance, Journal of the ACM (JACM), v.21 n.1, p.31-39, Jan. 1974  [doi>10.1145/321796.321800]

141

M. A. Franklin , G. Scott Graham , R. K. Gupta, Anomalies with variable partition paging algorithms, Communications of the ACM, v.21 n.3, p.232-236, March 1978  [doi>10.1145/359361.359451]

142

M. A. Franklin , R. K. Gupta, Computation of page fault probability from program transition diagram, Communications of the ACM, v.17 n.4, p.186-191, April 1974  [doi>10.1145/360924.360928]

143

W, F. Freiberger, U. Grenander and P. D. Sampson, "Patterns in Program References", IBM J. Res. and Devel., 19, 3, May, 1975, pp. 230--243.

144

I. F. Freibergs, "The Dynamic Behavior of Programs", Proc. FJCC, 1968, pp. 1163--1167.

145

E. J. Gaudion. "Today IBM Announces Yesterday", Datamation, February, 1973, pp. 53--54.

146

D. P. Gaver, P. A. W. Lewis and G. S. Shedler, "Analysis of Exception Data in a Staging Hierarchy", IBM J. Res. and Devel., 18, 5, September, 1974, pp. 423--435.

147

J. Gecsei, "Determining Hit Ratios for Multilevel Hierarchies", IBM J. Res. and Devel., 18, 4, July, 1974, pp. 316--327.

148

Erol Gelenbe, "A Unified Approach to the Evaluation of a Class of Replacement Algorithms", IEEETC, C-22, 6, June, 1973, pp. 611--618.

149

Erol Gelenbe, The distribution of a program in primary and fast buffer storage, Communications of the ACM, v.16 n.7, p.431-434, July 1973  [doi>10.1145/362280.362292]

150

E. Gelenbe, J. Lenfant and D. Potier, "Analyse d'un Algorithme de Gestion de Memoire Centrale et d'un Disque de Pagination", Acta Informatica 3, 1974, pp. 321--345.

151

E. Gelenbe , P. Tiberio , J.C. A. Boekhorst, Page size in demand-paging systems, Proceeding of the 1973 ACM SIGME symposium, p.1-12, January 1973  [doi>10.1145/800268.809330]

152

Erol Gelenbe and Alain Kurinckx, "Random Injection Control of Multiprogramming in Virtual Memory", IEEETSE, SE-4, 1, January, 1978, pp. 2--17.

153

M. Z. Ghanem, "Lifetime Function Shape in the Optimal Memory Allocation", IBM Research Report RC-4708, January, 1974.

154

M. Z. Ghanem, "On the Optimal Memory Allocation Problem", IBM Research Report RC-4443, July, 1973.

155

M. Z. Ghanem, "Experimental Study on the Behavior of Programs", IBM Research Report RC-5460, June, 1975.

156

M. Z. Ghanem, "Dynamic Partitioning of Main Memory Using the Working Set Concept", IBM J. Res and Devel., 19, 5, September, 1975, pp. 445--450.

157

M. Z. Ghanem, "Study of Memory Partitioning for Multiprogramming Systems with Virtual Memory, IBM J. Res. and Devel., 19, 5, September, 1975, ppo 451--457.

158

M. Z. Ghanem and H. Kobayashi, "A Parametric Representation of Program Behavior in Virtual Memory Systems". Proc. Eighth Princeton Conf. on Info. Sci. and Sys. 1974, pp. 327--330.

159

David K. Gifford, Hardware estimation of a process' primary memory requirements, Communications of the ACM, v.20 n.9, p.655-663, Sept. 1977  [doi>10.1145/359810.359833]

160

Robert P. Goldberg and Robert Hassinger, "The Double Paging Anomaly", Proc. NCC, 1974, pp. 195--199.

161

G. Scott Graham , Peter J. Denning, Multiprogramming and program behavior, Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation, p.1-8, January 1974

162

G. S. Graham and Peter J. Denning, "On the Relative Controlability of Memory Policies", from Computer Performance, ed. Chandy and Reiser, North Holland, 1977, pp. 411--428.

163

B. Greenberg, AN EXPERIMENTAL ANALYSIS OF PROGRAM REFERENCE PATTERNS IN THE MULTICS VIRTUAL MEMORY, Massachusetts Institute of Technology, Cambridge, MA, 1974

164

Dale H. Grit, "Global LRU Page Replacement in a Multiprogrammed Environment", Proc. 1977 SIGMETRICS / CMG VIII Conference on Computer Performance: Modeling, Measurement and Management, December, 1977, Washington, D.C., pp. 265--270.

165

Dale H. Grit , Richard Y Kain, An analysis of a use bit page replacement algorithm, Proceedings of the 1975 annual conference, p.187-192, January 1975  [doi>10.1145/800181.810313]

166

Ram K. Gupta and Mark A. Franklin, "Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison", IEEETC, C-27, 8, August, 1978, pp. 706--712.

167

J. A. Hamilton. "Congestion in Multilevel Paging Hierarchies". Proc. Int. Symp. on Computer Performance Modeling, Measurement and Evaluation, Yorktown Heights, N.Y., August, 1977, pp. 397--409.

168

D. J. Hatfield, "Experiments on Page Size, Program Access Patterns and Virtual Memory Performance", IBM J. Res. and Devel., 16, 1, January, 1972, pp. 58--66.

169

D. J. Hatfield and J. Gerald, "Program Restructuring for Virtual Memory", IBM Sys. J., 10, 3, 1971, pp. 168--193.

170

D. Hatfield and J. Gerald, "Locality: Working Set, Request String, Distance Function and Replacement Stack", from Statistical Computer Performance Evalution, ed. Freiberger, Academic Press, 1972, pp. 407--422.

171

Robert L. Hedges , Udo W. Pooch, A measure for program locality in demand paging, Proceedings of the 1975 annual conference, p.181-186, January 1975  [doi>10.1145/800181.810312]

172

H. Hellerman, Complementary replacement: a meta scheduling principle, Proceedings of the second symposium on Operating systems principles, October 20-22, 1969, Princeton, New Jersey  [doi>10.1145/961053.961070]

173

Greg Henderson , Juan Rodriguez-Rosell, The optimal choice of window sizes for working set dispatching, Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation, p.10-33, January 1974

174

P. R. Hoffman and J. B. Page. "Page Replacement Algorithm", IBM Tech. Disc. Bull., 16, 8, January, 1974, p. 2734.

175

W. C. Hohn and P. D. Jones. "The Control Data Star-100 Paging Station", Proc. NCC, 1973, pp. 421--426.

176

Giorgio Ingargiola , James F. Korsh, Finding Optimal Demand Paging Algorithms, Journal of the ACM (JACM), v.21 n.1, p.40-53, Jan. 1974  [doi>10.1145/321796.321801]

177

Donald R. Innes, "Exploiting the Least Recently Used Page Replacement Algorithm", Software - Practice and Experience, 7, 2, 1977, pp. 271--273.

178

Donald R. Innes and Shalom Tsur, "Interval Analysis, Pagination and Program Locality", Info. Proc. Letters, 5, 4, October, 1976, pp. 91--96.

179

Robert M. Jones, "Factors Affecting the Efficiency of a Virtual Memory", IEEETC, C-18, 11, November, 1969, pp. 1004--1008.

180

M. Joseph, "An Analysis of Paging and Program Behavior", Computer Journal, 13, 1, February, 1970, pp. 48--54.

181

Kevin Comerford Kahn, Program behavior and load dependent system performance., 1976

182

Richard Y. Kain, How to evaluate page replacement algorithms, Proceedings of the fifth ACM symposium on Operating systems principles, p.1-5, November 19-21, 1975, Austin, Texas, United States

183

T. Kilburn, D. B. G. Edwards, M. J. Lanigan and F. H. Sumner. "One Level Storage System", IRE Trans. on Electronic Computers, EC-11, 4, April, 1962, pp. 223--235.

184

Steven R. Kimbleton, "Core Complement Policies for Memory Allocation and Analysis", Proc. FJCC, 1972, pp. 1155--1162.

185

W. F. King III, "Analysis of Demand Paging Algorithms", Proc. IFIP Congress, 1971, Ljubljana, Yugoslavia, August, 1971, pp. TA-3-155-TA-3-159.

186

Makoto Kobayashi, "A Program Behavior Model - MLRUM", the 15'th National Conference of the Information Processing Society of Japan, 1974, p. 95.

187

Makoto Kobayashi, "A Set of Strategy Independent Restructuring Algorithms, Software - Practice and Experience, 7, 5, 1977, pp. 585--594

188

Makoto Kobayashi and H. Kubo "On Dynamic Program Behavior", The 13'th National Conf. of the Info. 'Proc. Soc. of Japan, 1972, p. 127.

189

Hidehito Kubo and Makoto Kobayashi, "Evaluation of Optimal Page Size and Initial Loading Under a Systemwide Criteria", NEC Research and Development, No. 41, April, 1976, pp. 27--37.

190

D. J. Kuck and D. H. Lawrie, "The Use and Performance of Memory Hierarchies: A Survey", Tech. Rept. No. 363, Department of Computer Science, University of Illinois, Urbana, Ill., December, 1969.

191

C. J. Kuehner, B. Randell "Demand Paging In Perspective", Proc. FJCC 1968, pp. 1011--1018.

192

Tomás Lang , Christopher Wood , Eduardo B. Fernández, Database buffer paging in virtual storage systems, ACM Transactions on Database Systems (TODS), v.2 n.4, p.339-351, Dec. 1977  [doi>10.1145/320576.320585]

193

E. R. Lassettre and H. Schiller, "Optimizing Process for Page to Page Frame Binding Duration" IBM Tech. Disc. Bull., 17, 5, October, 1974, pp. 1435--1439.

194

J. Lenfant, "Comportment des Programmes dabs Leur Espace D'addressage", Thesis, University de Rennes, November, 1974.

195

Jacques Lenfant, "The Delay Network Model of Program Behavior", Computer Architecture and Networks, ed. Gelenbe and Mahl, North Holland, 1974, pp 299--329.

196

J. Lenfant, "Ensembles de Travail et Intervalles Bornes de Localite", RAIRO-Informatique (AFCET), 12, 1, 1978, pp. 15--35.

197

Jacques Lenfant, "Comparison of the Working Sets and Bounded Locality Intervals of a Program", IRIA Research Report.

198

J. Lenfant and P. Burgevin, "Empirical Data on Program Behavior", Proc ACM Intl. Symp., ed. Gelenbe and Potier, North Holland, 1975, pp, 163--170.

199

Patrice Burgevin , Jacques Leroudier, Characteristics and models of program behaviour, Proceedings of the annual conference, p.344-350, October 20-22, 1976, Houston, Texas, United States  [doi>10.1145/800191.805613]

200

Jacques Leroudier , Dominique Potier, Principles of optimality for multiprogramming, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.211-218, March 29-31, 1976, Cambridge, Massachusetts, United States  [doi>10.1145/800200.806197]

201

J. Leroudier and D. Potier, "A Two Level Control Scheme for Multiprogrammed Virtual Memory Computer Systems", IRIA Research Report 141, November, 1975.

202

Art Lew, "Optimal Control and Demand Paging Systems", Proc. 3'rd Milwaukee Symp. on Automatic Computation and Control, pp. 355--360.

203

C. H. Lewis and R. A. Nelson, "Some One Pass Algorithms for the Generation of OPT Distance Strings", IBM Research Report RC-4758, March, 1974.

204

P. A. W. Lewis and G. S. Shedler, "Empirically Derived Micro Models for Sequences of Page Exceptions", IBM J. Res. and Devel., 17, 2, March, 1973, pp. 86--100.

205

P. A. W. Lewis and P. C. Yue, "Statistical Analysis of Program Reference Patterns in a Paging Environment", Digest IEEE Conf., 1971.

206

Yeong S. Lin and Richard L. Mattson, "Cost-Performance Evaluation of Memory Hierarchies", IEEE Trans. on Magnetics, MAG-8, 3, September, 1972, pp. 390--392.

207

Mark Harry Liu, A study of memory management algorithms and performance measures., 1976

208

P. A. W. Lewis and P. C. Yue, "Statistical Analysis of Program Reference Patterns in a Paging Environment", Proc. 1971 IEEE International Computer Society Conf., September, Boston, Mass, pp. 133--134.

209

Thomas C. Lowe, Automatic segmentation of cyclic program structures based on connectivity and processor timing, Communications of the ACM, v.13 n.1, p.3-6, Jan. 1970  [doi>10.1145/361953.361957]

210

B. P. Lubart and K. T. Ryder, "Dynamic Page Storage Migration in Virtual Storage Systems", IBM Tech. Disc. Bull., 18, 8, January,1976, pp. 2584--2585.

211

William C. Lynch and Juliana S. Tu, "Locality of Memory Reference by Space in a Paged Environment", Jennings Computer Center Report 1162, Case Western Reserve University, January, 1975.

212

William C. Lynch and Juliana S. Tu, "Locality of Memory Reference by Time in a Paged Environment", Jennings Computer Center Report 1161, January, 1975, Case Western Reserve University.

213

William C. Lynch and Juliana S. Tu, "Empirical Stochastic Working Set Behavior in a Paged Environment", Jennings Computer Center Report 11607, Case Western Reserve University, January, 1975.

214

F. B. MacKenzie, "Automated Secondary Storage Management", Datamation, 11, 11, 1965, pp. 24--28.

215

A. Wayne Madison , Alan P. Batson, Characteristics of program localities, Communications of the ACM, v.19 n.5, p.285-294, May 1976  [doi>10.1145/360051.360227]

216

S. E. Madnick, STORAGE HIERARCHY SYSTEMS, Massachusetts Institute of Technology, Cambridge, MA, 1973

217

Takenori Makino and Naoya Ohno, "Characteristics of Not Found Probability in Memory Hierarchy System", NEC Research and Development, no. 43, October, 1976, pp. 51--58.

218

K. Maruyama, "MLRU Page Replacement Algorithm in Terms of the Reference Matrix", IBM Tech. Disc. Bull., 17, 10, March, 1975, pp. 3101--3103.

219

K. Maruyama. "Implementation of the Stack Operation Circuit for LRU Algorithm", IBM Tech. Disc. Bull., 19, 1, June, 1976, pp. 321--325.

220

Takashi Masuda, Effect of program localities on memory management strategies, Proceedings of the sixth ACM symposium on Operating systems principles, p.117-124, November 16-18, 1977, West Lafayette, Indiana, United States

221

Takashi Masuda and Hiroyuki Shiota, "Optimization of Program Organization in Virtual Storage Systems", J. of Info. Proc. Soc. of Japan, 15, 9, 1974, pp. 662--669.

222

Takashi Masuda and Hiroyuki Shiota, "Program Locality and Its Maximization in Virtual Storage Systems", J. Info. Proc. Soc. of Japan, 16, 12, 1975, pp. 1005--1063.

223

T. Masuda, H. Shiota, K. Noguchi and T. Ohki, "Optimization of Program Organization by Cluster Analysis", Proc. IFIPS 1974, pp. 261--265.

224

T. Masuda, N. Takahashi and Y. Yoshizawa, "Comparison of Swapping Algorithms and Analysis of Program Behavior in Paging Machine", Information Processing Society of Japan, 12, February, 1972, pp. 70--75.

225

R. L. Mattson, J. Gecsei, D. R. Slutz and I. L. Traiger, "Evaluation Techniques for Storage Hierarchies", IBM Sys. J., 9, 2, 1970, pp. 78--117.

226

Richard L. Mattson and Jean-Paul Jacob, "Optimization Studies for Computer Systems with Virtual Memory", Proc. IFIPS 1968, pp. 846--852.

227

John W. McCredie, Jr., Measurement criteria for virtual memory paging rules, Proceedings of the 1969 24th national conference, p.193-199, August 26-28, 1969  [doi>10.1145/800195.805932]

228

A. C. McKellar , E. G. Coffman, Jr., Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, v.12 n.3, p.153-165, March 1969  [doi>10.1145/362875.362879]

229

Debasis Mitra, Some Aspects of Hierarchical Memory Systems, Journal of the ACM (JACM), v.21 n.1, p.54-65, Jan. 1974  [doi>10.1145/321796.321802]

230

James B. Morris, Demand paging through utilization of working sets onr the MANIAC II, Communications of the ACM, v.15 n.10, p.867-872, Oct. 1972  [doi>10.1145/355604.361592]

231

J. E. Morrisson, "User Program Performance in Virtual Storage Systems" IBM Sys. J., 12, 3, 1973, pp. 216--237.

232

R. R. Muntz and H. Opderbeck, "Stack Replacement Algorithms for Two Level Directly Accessible Page Memories", SIAM J. on Computing, 3, 1, March, 1974, pp. 11--22.

233

Yoichi Muraoka, "An Address Pattern Generator for an On-Demand Paging System Simulation", Information Processing in Japan, 16, 1976, pp. 13--18.

234

T. Nishimoto, "Memory Hierarchy of Computer with Virtual Memory System", J. Information Processing Society of Japan, 14, 10, 1973, pp. 762--768.

235

C. Thomas Nute and Udo W. Pooch, "Evaluation of Virtual Memory Paging Systems", Proc. Sixth Texas Conf. on Computing Systems, November, 1977, University of Texas at Austin, pp. 8B-1-8B-9.

236

P. H. Oden , G. S. Shedler, A model of memory contention in a paging machine, Communications of the ACM, v.15 n.8, p.761-771, Aug. 1972  [doi>10.1145/361532.361554]

237

N. A. Oliver, "Experimental Data on Page Replacement Algorithm", Proc. NCC, 1974, pp. 179--184.

238

R. W. O'Neill, "Experience Using a Timeshared Multiprogramming System with Dynamic Address Relocation Hardware", Proc. SJCC, 1967, pp. 611--621.

239

Holger Opderbeck, Measurement and modeling of program behavior and its applications., 1973

240

Holger Opderbeck and Wesley W. Chu, "Performance of the Page Fault Frequency Replacement Algorithm in a Multiprogramming Environment" Proc. IFIPS Conf., Stockholm, Sweden, August, 1974, pp. 235--241.

241

Holger Opderbeck and Wesley W. Chu, "The Renewal Model for Program Behavior", SIAM J. on Computing, 4, 3, September, 1975, pp. 356--374.

242

M. Parent and D. Potier, "A Note on the Influence of Program Loading on the Page Fault Rate", Acta Informatica, 8, 4, 1977, pp. 359--370.

243

D. P. Pazel, "Mathematical Constructs for Program Reorganization", IBM J. Res. and Devel., 19, 6, November, 1975, pp. 575--581.

244

Tad Brian Pinkerton, Program behavior and control in virtual storage computer systems, 1968

245

John E. Pomeranz, "Paging With Fewest Expected Replacements", Proc. IFIPS Conf., Ljubljana, Yugoslavia, August, 1971, pp. TA-3-160-TA-3-162.

246

Udo W. Pooch, A dynamic clustering strategy in a demand paging environment, Proceedings of the 4th symposium on Simulation of computer systems, p.11-22, August 10-12, 1976, Boulder, Colorado, United States

247

Udo W. Pooch , David M. Burris, A Modified Locality Matrix Model (MLMM) - dynamic clustering in a demand paging environment, Proceedings of the annual conference, p.337-343, October 20-22, 1976, Houston, Texas, United States  [doi>10.1145/800191.805612]

248

Dominique Potier, Analysis of demand paging policies with swapped working sets, Proceedings of the sixth ACM symposium on Operating systems principles, p.125-131, November 16-18, 1977, West Lafayette, Indiana, United States

249

Barton G. Prieve, Using page residency to select the working set parameter, Communications of the ACM, v.16 n.10, p.619-620, Oct. 1973  [doi>10.1145/362375.362395]

250

Barton G. Prieve, "A Page Partition Replacement Algorithm", Ph.D. Dissertation, University of California, Berkeley, 1974.

251

Barton G. Prieve and R. S. Fabry, "Evaluation of a Page Partition Replacement Algorithm", Bell Lab. Naperville, Ill., Tech. Rept., October, 1973.

252

Barton G. Prieve , R. S. Fabry, MIN—an optimal variable-space page replacement algorithm, Communications of the ACM, v.19 n.5, p.295-297, May 1976  [doi>10.1145/360051.360231]

253

Gary Raetz, "Adaptive Memory Management in a Paging Environment", MS Thesis, US Naval Post Graduate School, Monterey, Ca., December, 1973.

254

Abbas Rafii, "Empirical Analytic Studies of Program Reference Behavior", SLAC Report 197, July, 1976, Stanford Linear Accelerator Center, Stanford, Ca.

255

Jai T. Rao, "Memory Use Estimator Function of a Program Executing in a Paging Environment", Proc. Second Texas Conf. on Computing Sys., University of Texas, Austin, Texas, November, 1973, pp. 15-1-15-7.

256

B. R Rau, The stack working set: a characterization of spatial locality, Stanford University, Stanford, CA, 1975

257

B. R Rau, Properties and applications of the least-recently-used stack model, Stanford University, Stanford, CA, 1977

258

Y. V. Reddy, "Optimal Segment Size for Storage Allocation in a Multiprogrammed Computer System", Proc. IEEE Computer Society Conference, September, 1975, pp. 303--305.

259

Juan Rodriguez-Rosell, Experimental data on how program behavior affects the choice of scheduler parameters, Proceedings of the third ACM symposium on Operating systems principles, p.156-163, October 18-20, 1971, Palo Alto, California, United States  [doi>10.1145/800212.806514]

260

Juan Rodriguez-Rosell. "The Working Set Behavior of Some Programs", Report NA 72.51, Department of Information Processing, Royal Institute of Technology, Stockholm, Sweden.

261

Juan Rodriguez-Rosell and Jean-Pierre Dupuy. "The Evaluation of a Time-Sharing Page on Demand System", Proc. SJCC, 1972, pp. 759--765.

262

Juan Rodriguez-Rosell , Jean-Pierre Dupuy, The design, implementation, and evaluation of a working set dispatcher, Communications of the ACM, v.16 n.4, p.247-253, April 1973  [doi>10.1145/362003.362032]

263

Juan Rodriguez-Rosell, Empirical working set behavior, Communications of the ACM, v.16 n.9, p.556-560, Sept. 1973  [doi>10.1145/362342.362356]

264

Thomas A. Ryan Jr. and Edward G. Coffman Jr., "Markov Models of Parallelism in Loading and Execution of a Single Process", Computer Architectures and Networks, ed. Gelenbe and Mahl, August, 1974, North Holland, pp. 375--387.

265

T. A. Ryan, Jr., and E. G. Coffman, Jr., "A Problem in Multiprogrammed Storage Allocation", IEEETC, C-23, 11, November, 1974, pp. 1116--1122.

266

K. D. Ryder, "Module Packing in a Virtual Memory Environment", IBM Tech. Disc. Bull., 18, 8, January, 1975, pp. 2586--2587.

267

E. Sadeh, An analysis of the performance of the page fault frequency (PFF) replacement algorithm., Proceedings of the fifth ACM symposium on Operating systems principles, p.6-13, November 19-21, 1975, Austin, Texas, United States

268

Jerome H. Saltzer, A simple linear model of demand paging performance, Communications of the ACM, v.17 n.4, p.181-186, April 1974  [doi>10.1145/360924.360926]

269

Jerome H. Saltzer, "On the Modeling of Paging Algorithms", CACM, 19, 5, May, 1976, pp. 307--308. (See also CACM, 19, 8, August, 1976, pp. 476--477).

270

Burnett H. Sams, The case for dynamic storage allocation, Communications of the ACM, v.4 n.10, p.417-418, Oct. 1961  [doi>10.1145/366786.366790]

271

D. Sayre, Is automatic “folding” of programs efficient enough to displace manual?, Communications of the ACM, v.12 n.12, p.656-660, Dec. 1969  [doi>10.1145/363626.363629]

272

A. L. Scherr, "Analysis of Storage Performance and Dynamic Relocation Techniques", IBM Sys. Development Division Report TR00.1494, September, 1966.

273

A. Schroeder, "A Statistical Approach to the Study of Program Behavior Via Reference String Analysis", Computer Performance, North Holland, 1977, pp. 381--396.

274

Akira Sekino, Throughput analysis of multiprogrammed virtual-memory computer systems, Proceeding of the 1973 ACM SIGME symposium, p.47-53, January 1973  [doi>10.1145/800268.809335]

275

G. S. Shedler and D. R. Slutz, "Derivation of Miss Ratios from Merged Access Streams", IBM J. Res. and Devel., 20, 5, September, 1976, pp. 505--517.

276

G. S. Shedler and C. Tung, "Locality in Page Reference Strings", SIAM J. on Computing, 1, 3, September, 1972, pp. 218--241.

277

Jack Shemer and Someshwar Gupta. "On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation", IEEETC, EC-15, 6, December, 1966, pp. 855--863.

278

J. E. Shemer and G. A. Shippey. "Statistical Analysis of Paged and Segmented Computing Systems", IEEETEC, EC-15, 6, December, 1966, pp. 855--863.

279

Sherry Sisson, Michael J. Flynn, "Addressing Patterns and Memory Handling Algorithms", Proc. FJCC, 1968, pp. 957--967.

280

D. R. Slutz, "A Relation Between Working Set and Optimal Algorithms for Segment Reference Strings", IBM Research Report RJ 1623, July, 1975.

281

D. R. Slutz, "Interval Stack Processing from Least Recently Used Replacement Algorithm", IBM Tech. Disc. Bull., 18, 11, April, 1976, pp 3824--3825.

282

Donald R. Slutz, "A Look at Paging Algorithms and Program Models", source unknown, pp. 432--436.

283

D. R. Slutz and I. L. Traiger, "Determination of Hit Ratios for a Class of Staging Hierarchies", IBM Research Report RJ-I044, May, 1972.

284

D. R. Slutz , I. L. Traiger, A note on the calculation of average working set size, Communications of the ACM, v.17 n.10, p.563-565, Oct. 1974  [doi>10.1145/355620.361167]

285

Alan Jay Smith, "4 Modified Working Set Paging Algorithm", IEEETC, C-25, 9, September, 1976, pp. 907--914.

286

Alan Jay Smith, On the effectiveness of set associative page mapping and its application to main memory management, Proceedings of the 2nd international conference on Software engineering, p.286-292, October 13-15, 1976, San Francisco, California, United States

287

Alan Jay Smith, "Analysis of the Optimal, Look Ahead, Demand Paging Algorithms", SIAM J. on Computing, 5, 4, December, 1976, pp. 743--757.

288

Alan Jay Smith, "Two Simple Methods for the Efficient Analysis of Memory Address Trace Data", IEEETSE, SE-3, 1, January, 1977, pp. 94--101.

289

Alan Jay Smith, Multiprocessor memory organization and memory interference, Communications of the ACM, v.20 n.10, p.754-761, Oct. 1977  [doi>10.1145/359842.359858]

290

Alan Jay Smith, "A Comparative Study of Set Assocative Memory Mapping Algorithms and Their Use for Cache and Main Memory", IEEETSE, SE-4, 2, March, 1978, pp. 121--130.

291

Alan Jay Smith, "Sequential Program Prefetching in Memory Hierarchies", to appear, IEEE Computer (1978?).

292

Alan Jay Smith, "Multiprogramming and Memory Contention" submitted for publication.

293

Alan Jay Smith, "Internal Scheduling and Memory Contention", submitted for publication.

294

John L. Smith, Microprogamming under a page on demand strategy, Communications of the ACM, v.10 n.10, p.636-646, Oct. 1967  [doi>10.1145/363717.363763]

295

Otto Spaniol, "Demand Prepaging Algorithms Basing on a Model of Locality of Programs", presented at Symp. on Computer Architectures and Networks, IRIA, August, 1974.

296

Jeffrey Robert Spirn, Program locality and dynamic memory management., 1973

297

Jeffrey Spirn, "A Model for Dynamic Allocation in a Paging Machine", Proc. Eighth Annual Princeton Conf. on Info. Sci. and Sys., 1974, pp. 337--334.

298

Jeffrey Spirn, "Distance String Models for Program Behavior", Computer, 9, 11, November, 1976, pp. 14--20.

299

Jeffrey R. Spirn, Program Behavior: Models and Measurements, Elsevier Science Inc., New York, NY, 1977

300

Jeffrey Spirn and Peter J. Denning, "Experiments with Program Locality", Proc. FJCC, 1972, pp. 611--621.

301

Jeffrey Spirn, Peter J. Denning and J. E. Savage, "Models for Locality in Program Behavior", Brown University Eng. Tech. Report June, 1974.

302

Richard Stone, "VS1 Dynamic Dispatching and Page Supervisor Algorithms, Release 3.1", Proc. SHARE 44, Los Angeles, Ca. March, 1975, pp. 635--646.

303

Michael Stonebraker, "Optimal Memory Allocation in a Multiprogrammed, Paged Environment", Proc. Second Texas Conf. on Computing Sys., Univ. of Texas, Austin, Texas, November, 1973, pp. 17--1 - 17--5.

304

P. H. Taloman, "Virtual Control Storage", IBM Tech. Disc. Bull., 16, 12, May, 1974, pp. 4008--4009.

305

R. D. Tennison, J. M. Waddell, D. L. Wade and D. E. Whitmer, "Memory Space Mapping Using Virtual Addressing to Multiple Size Memory Units", IBM Tech. Disc. BulI., 18, 3, August, 1975, pp. 619--621.

306

John M. Thorington Jr. and J. David Irwin, "An Adaptive Replacement Algorithm for Paged Memory Computer Systems", IEEETC, C-21, 10, October, 1972, pp. 1053--1061.

307

Kenneth J. Thurber , Peter C. Patton, Page size selection for a real time computer, Proceedings of the 1975 annual conference, p.198-203, January 1975  [doi>10.1145/800181.810315]

308

Rhett F. Tsao, L. W. Comeau and Barry H. Margolin, "A Multifactor Paging Experiment: I The Experiment and the Conclusions", from Statistical Computer Performance Evaluation, ed. Freiberger, Academic Press, New York, 1972, pp. 103--134.

309

Rhett F. Tsao and Barry H. Margolin, "A Multifactor Paging Experiment: II Statistical Methodology", from Statistical Computer Performance Evaluation, ed. Freiberger, Academic Press, New York, 1972., pp 135--158.

310

Shalom Tsur, "Extraction and Utilization of Intelligence in Paging Policies", Technical Report, February, 1976, University of Newcastle upon Tyne.

311

Trân Quôc Tê, An heuristic model for analysis of memory use under static partition allocation strategies, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.272-281, March 29-31, 1976, Cambridge, Massachusetts, United States  [doi>10.1145/800200.806202]

312

Kishor S. Trivedi, "A Performance Comparison of Systems With and Without Virtual Memory", Computer Science Report CS-1976-9, June, 1976, Duke University.

313

Kishor S. Trivedi, "Prepaging and Applications in Array Algorithms", IEEETC, C-25, 9, September, 1976, pp. 915--921.

314

Kishor S. Trivedi, "Prepaging and Applications to the STAR-100 Computer", from High Speed Computer and Algorithm Organization, ed. Kuck, Lawrie and Sameh, Academic Press, 1977, pp. 435--446.

315

Kishor S. Trivedi, "On the Paging Performance of Array Algorithms", IEEETC, C-26, 10, October, 1977, pp. 938--947.

316

Kishor S. Trivedi, "An Analysis of Prepaging", Computer Science Report CS-1977-7, August, 1977, Duke University.

317

W. G. Tuel Jr., "An Analysis of Buffer Paging in Virtual Storage Systems", IBM J. Res. and Devel., 20, 5, Sept., 1976, pp. 518--520.

318

William G. Tuel Jr., "A Note on Working Set Miss Ratios", IBM Research Report RJ-1595, June, 1975.

319

Chin Tung, "On the Apparent Continuity of Processing in a Paging Environment", IEEETC, C-19, 11, November, 1970, pp. 1047--7054.

320

Rollins Turner , Bill Strecker, Use of the LRU stack depth distribution for simulation of paging behavior, Communications of the ACM, v.20 n.11, p.795-798, Nov. 1977  [doi>10.1145/359863.359868]

321

L. C. Varian , E. G. Coffman, An empirical study of the behavior of programs in a paging environment, Proceedings of the first ACM symposium on Operating System Principles, p.16.1-16.13, January 1967  [doi>10.1145/800001.811682]

322

G. M. Waddell and D. L. Way, "Scheduling Memory Resources in a Virtual Memory Environment", IBM Tech. Disc. Bull., 17, 7, December, 1974, pp. 1873--1874.

323

V. L. Wallace , D. L. Mason, Degree of multiprogramming in page-on-demand systems, Communications of the ACM, v.12 n.6, p.305-308, June 1969  [doi>10.1145/363011.363026]

324

Gerald M. Weinberg, "Programming and Compiling Strategies for Paging Systems", Software - Practice and Experience, 2, 1972, pp. 165--171.

325

R. M. Wharton, "A Page Replacement Strategy", from "Topics in Operating Systems", Tech. Report No. 23, January, 1971, Dept. of Computer Science, University of Toronto, Canada.

326

N. Weizer and G. Oppenheimer. "Virtual Memory Management in a Paging Environment", Proc. SJCC, 1969, pp. 234ff.

327

M. V. Wilkes, "The Dynamics of Paging", The Computer Journal, 16, 1, February, 1973, pp. 4--9.

328

John G. Williams. "Experiments in Page Activity Determination", Proc. SJCC, 1972, pp. 739--747.

329

J. Winograd , S. J. Morganstein , R. Herman, Simulation studies of a virtual memory, time-shared, demand paging operating system, Proceedings of the third ACM symposium on Operating systems principles, p.149-155, October 18-20, 1971, Palo Alto, California, United States  [doi>10.1145/800212.806513]

330

C. Wood, E. B. Fernandez and T. Lang, "Minimization of Demand Paging for the LRU Stack Model of Program Behavior", IBM Los Angeles Scientific Center Report G320--2689, July, 1977.

331

M. Yamada and Y. Hayashi, "Analysis of Address Pattern", Proc. National Conf. of the Electronics-Communication Society of Japan, 1969, pp. 953.

332

Frank Shi-Kong Yu, "Modeling the Write Behavior of Computer Programs", Ph.D. Dissertation, Stanford University Computer Science Department, May, 1976.

Alan Jay Smith, Long term file migration: development and evaluation of algorithms, Communications of the ACM, v.24 n.8, p.521-532, Aug. 1981

Timo O. Alanko , Ilkka J. Haikala , Petri H. Kutvonen, Methodology and empirical results of program behaviour measurements, ACM SIGMETRICS Performance Evaluation Review, v.9 n.2, p.55-66, Summer 1980

W. Abu-Sufah , R. Lee , M. Malkawi , P. Yew, Experimental results on the paging behavior of numerical programs, Proceedings of the 6th international conference on Software engineering, p.110-117, September 13-16, 1982, Tokyo, Japan

Percy Tzelnic , Izidor Gertner, An Approach to Program Behavior Modeling and Optimal Memory Control, Journal of the ACM (JACM), v.29 n.2, p.527-554, April 1982

Cyrus Shahabi , Farnoush Banaei-Kashani, Decentralized Resource Management for a Distributed Continuous Media Server, IEEE Transactions on Parallel and Distributed Systems, v.13 n.7, p.710-727, July 2002

Alan J. Smith, Disk cache—miss ratio analysis and design considerations, ACM Transactions on Computer Systems (TOCS), v.3 n.3, p.161-203, Aug. 1985

Y. Yoshizawa , T. Arai, Adaptive storage control for page frame supply in large scale computer systems, ACM SIGMETRICS Performance Evaluation Review, v.16 n.1, p.235-243, May 1988

Alan Jay Smith, Cache Memories, ACM Computing Surveys (CSUR), v.14 n.3, p.473-530, Sept. 1982

Özalp Babaoǧlu, Hierarchical replacement decisions in hierarchical stores, ACM SIGMETRICS Performance Evaluation Review, v.11 n.4, December 1982

Jeffrey A. Brumfield, A Guide To Operating Systems Literature, ACM SIGOPS Operating Systems Review, v.20 n.2, p.38-42, April 1986

Saied Hosseini-Khayat, On Optimal Replacement of Nonuniform Cache Objects, IEEE Transactions on Computers, v.49 n.8, p.769-778, August 2000

Cyrus Shahabi , Farnoush Banaei-Kashani, Decentralized Resource Management for a Distributed Continuous Media Server, IEEE Transactions on Parallel and Distributed Systems, v.13 n.11, p.1183-1200, November 2002

Theodore M. Wong , John Wilkes, My Cache or Yours? Making Storage More Exclusive, Proceedings of the General Track: 2002 USENIX Annual Technical Conference, p.161-175, June 10-15, 2002

Sorav Bansal , Dharmendra S. Modha, CAR: Clock with Adaptive Replacement, Proceedings of the 3rd USENIX Conference on File and Storage Technologies, March 31-31, 2004, San Francisco, CA

L. H. Seawright , R. A. MacKinnon, VM/370: a study of multiplicity and usefulness, IBM Systems Journal, v.18 n.1, p.4-17, March 1979

Alan Jay Smith: colleagues