Peter J. Denning
- A1 ABATE, J., AND DUBNER, It. Optimizing the performance of a drum-like storage. IEEE Trans. C-18, 11 (Nov. 1969), 992-997.Google Scholar
- A2 AHO, A. V., DENNING, P. J., AND ULLMAN, J. D. Principles of optimal page replacement. Computer Science Tech. Rep. No. 82, Princeton U., Princeton, N. J., Jan. 1970.Google Scholar
- A3 ANACKER, W., AND WANG, C.P. Performance evaluation of computing systems with memhierarchies. IEEE Trans. EC-16 (Dec. 1967), 764-772.Google Scholar
- A4 ARDEN, B. W., AND BOETTNEi% D. Measurement and performance of a multiprogramruing system. Proc. Second ACM Symp. on Operating Systems Principles~ Princeton, N. J., 20-22, 1969, pp. 130-146. Google Scholar
- A5 GALLER, B. A., O'BmEN, T. C., AND WESTERVELT, F. H. Program and addressstructure in a time-sharing environment. ACM 18, 1 (Jan. 1966), 1-16. Google Scholar
- B1 BASKETT, F., BROWNE, J. C., AND RAIKE, M. The management of a multi-level non-paged memory system. ProP. AFIPS 1970 Spring Joint Comput. Conf., Vol. 36, 459-465.Google Scholar
- B2 BATSON, A., Ju, S., ANn WOOD, D. Measurements of segment size. Proc. Second ACM Syrup. on Operating Systems Principles, Princeton, N. J., Oct. 20-22, 1969, pp. 25-29. Also, Comm. ACM 13, 3 (March 1970), 155-159. Google Scholar
- B3 BELADY, L. A. A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 2 (1966), 78-101. . Biased replacement algorithms for multiprogramming. Rep. NC697, IBM T. J. Watson Res. Center, Yorktown Heights, Y., March 1967. ---- ANn KUEHNER, C. J. Dynamic space sharing in computer systems. Comm. ACM 5 (May 1969), 282-288. Google Scholar
- B6 --, N~LSON, 1%. A., ANn SH~n{,En, G. S. A~ anomaly in the space-time characteristics of cert,~in programs running in paging machines. Comm. ACM 12, 6 (June 1969), 349- 353. Google Scholar
- B7 BENSOUSSAN, A,, CLtNGEN, C, T., AND DAI,~Y, R.C. The Multics virtual memory. Prec. Second ACM Syrup. on Operating Systems Principles, Princeton, N. J., Oct. 20- 22, 1969, pp. 30-42. Google Scholar
- B8 Bo~aow, I). G., ~NO McltP{~, D.L. Structure of a LISP system using two-level storage. Comm. ACM t0, 3 (March 1967), 155-159. Google Scholar
- B9 BRAWN, B., AND GUSTAVSON, F. Program behavior in a paging environment. Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. pp. 1019-1032.Google Scholar
- B10 BURROUGHS CORPORATION. The descriptor --A definition of the B5000 information processing system. Burroughs Corp., 1961.Google Scholar
- C1 CHar,-, Y. C. Selective transfer analysis. Rep. RC-1926, IBM T. J. Watson Research Center, Yorktown Heights, N. Y., 1968.Google Scholar
- C2 COFFMAN, E. G., JR. Analysis of a drum input/output queue under scheduled operat.ion in a paged computer system, d. ACM 16, t (Jan. 1969), 73-90. Google Scholar
- C3 --, a~o ValtlAN, L.C. Further experimental data on the behavior of programs m a paging environment. Comm. ACM 1i, 7 (July 1968), 471-474. Google Scholar
- C4 COHSN, J.A. Use of fast and slow memories in list processing languages. Comm. ACM 10, 2 (Feb. 1967), 82-86. Google Scholar
- C5 COUEN, L. J. Stochastic evaluation of a static storage allocation. Comm. ACM 4, 10 (Oct. 1961), 460-464. Google Scholar
- C6 COLLINS, G. 0., Jr. Experience in automatic storage allocation. Comm. ACM 4, 10 (Oct. 1961 ), 436-440. Google Scholar
- C7 COMEAU, L. A study of the effect of user program optimization in a paging system. ACM Syrup. on Operating System Principles, Gatlinburg, Tenn., Oct. 1-4, 1967 (7 pp.). Google Scholar
- C8 CORBATS, F. J. A paging experiment with the Multies s'rstem. Rep. MAC-M-384, MIT Project MAC' Cambridge, Mass., May 1968.Google Scholar
- D1 DALEY, R., ANI) DESNIS, J. B. Virtual memory, processes, and sharing in multics. Comm. ACM tl, 5 (May 1968), 306-312. Google Scholar
- D2 DEMEts, W.M., AND WmZER, N. Measurement and analysis of a demand paging time sharing system. Proc. 24th Nat. Conf. ACM, ACM Pub. P49, 1969, pp. 201-216. Google Scholar
- D3 DENNING, P. ft. Effects of scheduling on file memory operations. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, pp. 9-21.Google Scholar
- D4 ___, The working set model for program behavior, ecomm. ACM 11, 5 (May 1968), 323-333. Google Scholar
- D5 ____, Resource allocation in multiprocess computer systems. Tech. R ep. MAC-TR-50, MIT Project MAC, Cambridge, Mass., 1968 (Ph.D. thesis). Google Scholar
- D6 ____, Thrashing: Its causes and prevention. Proc. AFIPS 1968 Fall Joint Comput. Cool., Vol. 33, pp. 915-922.Google Scholar
- D7 ____, Equipment configuration in balanced computer systems. IEEE Trans. C-t8 (Nov. 1969), 1008-1012.Google Scholar
- D8 ____ AND BRVNO, J.L. On the management of multilevel memories. Computer Science Tech. Rep. 76, Princeton U., Princeton, N. J., April 1969.Google Scholar
- D9 ____, CHEN, Y. C., AND SHEDLER, G. S. A model for program behavior under demand paging. R ep. RC-2301, IBM T. J. Watson Kes. Center, Yorktown Heights, N. Y., Sept. t968.Google Scholar
- D10 DESNIS, J. B. Program structure in a multi-access computer. Tech. Rep. MAC- TR-11, MIT Project MAC, Cambridge, Mass. Google Scholar
- D11 ___, Segmentation and the design of multi.programmed computer systems. J. ACM 12, 4 (Oct. 1965), 589-602. Google Scholar
- D12 ____, AND GLASS.R, E. L. The structure of on-line information processing systems. Proc. Second Congress on Information Syst. Sci., Spartan Books, Washington, D. C., 1965, pp. 5-14.Google Scholar
- D13 ___, AND VAN HORN, E. C. Programming semantics for multiprogrammed computations. Comm. ACM 9, 3 (March 1966), 143- 155. Google Scholar
- D14 ____, Programming generality, parallelism and computer architecture. Proc. IFIP Congr. 1968, Vol. 1, North-Holland, Amsterdam, 1969, pp. 484-492 (Computation Struetures Group Memo 32, MIT Project MAC, Cambridge, Mass., Aug. 1968).Google Scholar
- F1 FIKES, R. E., LAUER, H. C., AND VAREHA, A. L., JR. Steps toward a general-purpose time-sharing system using large capacity core storage and TSS/360. Proc. 23rd Nat. Conf. ACM, ACM Pub. P-68, 1968, pp. 7-18. Google Scholar
- F2 FINE, G. H., JACKSON, C. W., AND MCISAAC, P. V. Dynamic program behavior under paging. Proc. 21st Nat. Conf. ACM, ACM Pub. P-66, 1966, pp. 223-228. Google Scholar
- F3 FOTHERINGHAM, J. Dynamic storage allocation in the At, la.,~ computer, including an automatic use of a backing store. Comm. ACM 4, 10 (Oct. 1961), 435-436. Google Scholar
- F4 FREIBERGS, I. F. The dynamic behavior of programs. Proc. AF1PS 1968 Fall Joint Comput. Conf., Vol. 33, pp. 1163-1168.Google Scholar
- F5 FUCHEL, K., AND HELLER, S. Considerations itl the design of a multiple computer system with extended core storage. Comm. A CM 11, 5 (May 1968), 334-340. Google Scholar
- H1 HELLERMAN, H. Complementary replacement--A meta scheduling principle. Proc. Second ACM Syrup. on Operating Systems Principles, Princeton, N. 3., Oct. 20-22, 1969, pp. 43-46. Google Scholar
- H2 HOLT, A. W. Program organization and record keeping for dynamic storage allocation. Comm. ACM 4, 10 (Oct. 1961), 422--431. Google Scholar
- I1 ILIFFE, J. K. Basic Machine Principles. American Elsevier, New York, 1968.Google Scholar
- I2 ___ AND JODEIT, J. G. A dynamic storage allocation scheme. Comput. d. 5 (Oct,. 1962), 200-209.Google Scholar
- J1 JOHNSTON, J. B. The structure of multiple activity algorithms. Proc. Third Annual Princeton wonf., Princeton, N. J., March 1969.Google Scholar
- J2 JONES, R.M. Factors affecting the efiiciency of a virtual memory. IEEE Trans. C-I8, 11 (Nov. 1969), 1004-1008.Google Scholar
- K1 KELLY, J. E., Jn. Techniques :for storage allocation algorithms. Comm. ACM 4, 10 (Oct. 1961), 449-454. Google Scholar
- K2 KERNIGHAN, B. W. Optimal segmentation points for programs. Proc. Second ACM Syrup. on Operating Systems Principles, Princeton, N. J., Oct. 20-22, 1969, pp. 47-53. Google Scholar
- K3 KILBURN, T., EDWARDS, D. B. G., LANIGAN, M. J., AND SUMNER, F.H. One-level storage system. IRE Trans. EC-I1, 2 (April 1962), 223-235.Google Scholar
- K4 KNUTH, D.E. The Art of Computer Programming, Vol. I. Addison-Wesley, Reading, Mass., 1968, pp. 435-455. Google Scholar
- K5 KUCK, D. J., AND LAWRIE, D. H. The use and performance of memory hierarchies: A survey. Tech. P~ep. No. 363, Dep. of Computer Sci., U. of Illinois, Urbana, Ill., Dec. 1969.Google Scholar
- K6 KUBHNER, C. J., AND RANDELL, B. Demand paging in perspective. Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. 33, pp. 1011-1018.Google Scholar
- L1 LAVEa, H. Bulk core in a 360/67 time sharing system. Proc. AFIPS 1967 Fall Joint Comput. Conf., Vol. 31, pp. 601-609.Google Scholar
- L2 LIPTAY, ft. S. The cache. IBM Sysl. J. 7, 1 (1968), 15-21.Google Scholar
- M1 MACKENZIE, F. B. Automated secondary storage management. Datamation 11, 11 (1965), 24-28.Google Scholar
- M2 MATTSON, R. L., GECSEI, J., SLUTZ, D. R., AND TRAIOER, I. W. Evaluation Techniques for Storage Hierarchies. IBM Syst. J. 9, 2 (1970), 78-117.Google Scholar
- M3 McCARTHY, J., CORBATO, F. J., AND DACGETT, M. M. The Linking Segment Sub-program Language and Linking Loader. cram. ACM 6, 7 (July 1963) 391-395. Google Scholar
- M4 McKzLLAa, A., AND COFFMAN, E. G. The organization of matrices and matrix operations in a paged multiprogramming environment. Comm. ACM I2, 3 (March I969), 153465. Google Scholar
- M5 M IT. Report of the long range computation study group, April 1961.Google Scholar
- O1 O'NEILI,, P. W. A preplanned approach to a storage allocating computer. Comm. ACM 4, 10 (Oct. 1961), 417. Google Scholar
- O2 Experience using a time sharing multiprogramming system wit.h dynamic address relocation hardware. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, pp. 611-621.Google Scholar
- O3 OPPENHEIMER, G., AND WEIZER, N. Resource management for a medium scale time sharing operatirtg system. Comm. ACM II, 5 (May 1968), 313-322. Google Scholar
- P1 PINKERTON, T. Program behavior and control in virtual storage computer systems. CONCOMP Project Rep. No. 4, U. of Mich., April 196B (Ph.D. thesis). Google Scholar
- P2 POOLE, P. C., ANI) WAITE, W. Machineindependent, software. Proc. Second ACM Symposium on Operating Systems Principles, Princeton, N. J., Oct. 20-22, 1969, pp. 19-24. Google Scholar
- R1 RAMAMOORTUY, C.V. The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers. Proc. 21st Nat. Conf. ACM, ACM Pub. P~66, 1966, pp. 229-239. Google Scholar
- R2 RANDELL, B. A note on storage fragmentation and program segmentation. Comm. ACM 12, 7 (July 1969), 365-369. Google Scholar
- R3 ANO KI:EHNER, C. J. Dynamic storage allocation systems. Comm. A CM 1I (May 1968), 297-305. Google Scholar
- R4 RISKIN, B. N. Core allocatiort ba~ed on probability. Comm. ACM 4, l0 (Oct. 196t), 454-459. Google Scholar
- S1 SAMS, B. H. The case for dynamic storage Mlocation. Comm. ACM 4, 10 (Oct. 1961), 417-418. Google Scholar
- S2 SAYaE, D. Is automatic folding of programs efficient enough t.o displace manual? Comm. ACM 12, 12 (Dee. 1969), 656-660. Google Scholar
- S3 SHEMER, J. E., AND GUPTA, S. C. On the design of Bayesian storage allocation algorithms for paging and segmentation. IEEE Trans. C-I8, 7 (July 1969), 644-651.Google Scholar
- S4 ___ AND SHIPPEY, B. Statistical analysis of paged and segmented computer systems. IEEE Trans. EC-t5, 6 (Dec. 1966), 855-863.Google Scholar
- S5 SMITH, J. L. Multiprogramming under a page on demand strategy. Comm. ACM t0, 10 (Oct,. 1967), 636-646. Google Scholar
- S6 STONE, H. S. A logic-in-memory computer. IEEE Trans. C.19, 1 (Jan. 1970), 73-78.Google Scholar
- V1 VAREHA., A. L., RUTLEDGE, R. M., AND GOLD, M. M. Strategies for structuring two-level memorms in a paging environment. Proc. Second ACM Syrup. on Operating Systems Principles, Princeton, N. J., Oct. 20-22, 1969, pp. 54-59. Google Scholar
- W1 WEINGARTEN, A. The Eschenbach drum scheme. Comm. ACM 9, 7 (July 1966), 509- 512. Google Scholar
- W2 WEIZER, N., ANY OPPEN~IEIMlilR, G. Virtual memory management in a paging environ+ ment. Proc. AFIPS 1969 Spring Joint Comput. Conf., Vol. 34, p. 234.Google Scholar
- W3 WILKES, M. V. Slave memories and dynamic storage allocation. IEEE Trans.EC-14 (April 1965), 270-271.Google Scholar
- W4 ----. Time Sharing Computer Bystems. American Elsevier, New York, 1958. Google Scholar
- W5 ___. Computers then and now. J. ACM 15, 1 (Jan. 1968), 1-7. Google Scholar
- W6 ____. h model for core space allocation in a time sharing system. Proe. AFIPS 1969 Spring Joint Comput Conf., Vol. 34, pp. 265-271.Google Scholar
- W7 Woumhn, E. A fixed optimum cell-size for records of various lengths. J. ACM t2, 1 (Jan 1965), 53-70. Google Scholar
Recommendations
Energy-aware flash memory management in virtual memory system
The traditional virtual memory system is designed for decades assuming a magnetic disk as the secondary storage. Recently, flash memory becomes a popular storage alternative for many portable devices with the continuing improvements on its capacity, ...
Cooperating Write Buffer Cache and Virtual Memory Management for Flash Memory Based Systems
RTAS '11: Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications SymposiumFlash memory is becoming the storage media of choice for mobile devices and embedded systems. The performance of flash memory is impacted by the asymmetric speed of read and write operations, limited number of erase times and the absence of in-place ...
An efficient garbage collection for flash memory-based virtual memory systems
As more consumer electronics adopt monolithic kernels, NAND flash memory is used for the swap space in virtual memory systems. While flash memory has the advantages of low-power consumption, shock-resistance and non-volatility, it requires garbage ...
Comments