Demand paging through utilization of working sets onr the MANIAC II
暂无分享,去创建一个
[1] Bernard A. Galler,et al. Program and Addressing Structure in a Time-Sharing Environment , 1966, JACM.
[2] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..
[3] Michael D. Schroeder,et al. Performance of the GE-645 associative memory while Multics is in operation , 1971, SIGOPS Workshop on System Performance Evaluation.
[4] Brian Randell,et al. Dynamic storage allocation systems , 1968, CACM.
[5] Tom Kilburn,et al. One-Level Storage System , 1962, IRE Trans. Electron. Comput..
[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[7] Peter J. Denning,et al. Resource allocation in multiprocess computer systems , 1968 .
[8] Brian Randell,et al. Demand paging in perspective , 1968, AFIPS '68 (Fall, part II).
[9] Norman Weizer,et al. Virtual memory management in a paging environment , 1899, AFIPS '69 (Spring).
[10] John A. Fotheringham,et al. Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store , 1961, Commun. ACM.
[11] Jack B. Dennis,et al. Segmentation and the Design of Multiprogrammed Computer Systems , 1965, JACM.
[12] I. F. Freibergs,et al. The dynamic behavior of programs , 1968, AFIPS '68 (Fall, part II).
[13] Norman Weizer,et al. Resource management for a medium scale time-sharing operating system , 1968, CACM.
[14] Jack E. Shemer,et al. Statistical Analysis of Paged and Segmented Computer Systems , 1966, IEEE Trans. Electron. Comput..
[15] J. K. Iliffe,et al. Basic machine principles , 1968 .
[16] Paul Walton Purdom,et al. Statistical Properties of the Buddy System , 1970, JACM.