论文信息 - Algorithm of dynamic segmented memory allocation - 字舞流文

Algorithm of dynamic segmented memory allocation

[1] William M. Waite,et al. A Compaction Procedure for Variable-Length Storage Elements , 1967, Comput. J..

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] Leon Presser,et al. Dynamic memory repacking , 1974, CACM.

[4] James L. Peterson,et al. A weighted buddy method for dynamic storage allocation , 1974, CACM.

[5] Jeffrey S. Fenton,et al. Dynamic Storage Allocation of Arbitrary Sized Segments , 1974, IFIP Congress.

[6] W. W. Chu,et al. Performance of replacement algorithms with different page sizes , 1974, Computer.

[7] John E. Shore. On the external storage fragmentation produced by first-fit and best-fit allocation strategies , 1975, CACM.

[8] Robert W. Doran. Virtual Memory , 1976, Computer.

[9] Richard B. Bunt,et al. Scheduling Techniques for Operating Systems , 1976, Computer.

[10] Alan Jay Smith. A Modified Working Set Paging Algorithm , 1976, IEEE Transactions on Computers.

[11] Harry T. Hsu. A note on weighted buddy systems for dynamic storage allocation , 1976 .

[12] Carter Bays,et al. A comparison of next-fit, first-fit, and best-fit , 1977, CACM.

[13] Peter J. Denning,et al. The working set model for program behavior , 1968, CACM.