skip to main content
article
Free Access

Asymmetric memory hierarchies

Published:01 April 1973Publication History
Skip Abstract Section

Abstract

A study is presented of some of the system implications of memory hierarchies in which the backing or secondary store has a very small read time, relative to both the time required for writing and to the read time of conventional backing storage devices. Several analytic models are introduced, and it is shown that such hierarchies may operate in ways which differ from those of more conventional hierarchies. In particular, it is shown that it may not be necessary to multiprogram in such a situation.

In the past, backing storage devices have been roughly symmetric with respect to their read and write times. This situation may not continue, as several devices are currently under development which may have a very small read-time/write-time ratio. This study places particular emphasis on one such system—the RCA read/write holographic optical memory.

References

  1. 1 Belady, L.A. A study of replacement algorithms for a virtual-storage computer. IBM Systems J. 5, 2 (1966), 78-101.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Bobeck, A.H., Fischer, R.F., and Perneski, A.J. A new approach to memory and logic----cylindrical domain devices. Proc. AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Montvale, N.J., pp. 489--498.Google ScholarGoogle Scholar
  3. 3 Boyle, W.S., and Smith, G.E. Charge coupled semiconductor devices. Bell Syst. Tech. J. 49, 4 (Apr. 1970), 587-593.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4 Brawn, B.S, and Gustavson, F.G. Program behavior in a paging environment. Proc. AFIPS 1968 FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 1019-1032.Google ScholarGoogle Scholar
  5. 5 Coffman, E.G. A simple probability model yielding performante bounds for modular memory systems. IEEE Trans. Comput. C-17, 1 (Jan. 1968), 86-89.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Coffman, E.G., and Varian, L.C. Further experimental data on the behavior of programs in a paging environment. Comm. ACM 11, 7 (July 1968), 471-474. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Denning, P.J. Thrashing: its causes and prevention. Proc. AFIPS 1968 FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 915-922.Google ScholarGoogle Scholar
  8. 8 Denning, P.J. Virtual memory. Computing Surveys 2, 3 (Sept. 1970), 153-189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Dickinson, R.V., and Orr, W.K. System ten--a new approach to multiprogramming. Proc. AFIPS 1970 FJCC, Voi. 37, AFIPS Press, Montvale, N.J., pp. 181-186.Google ScholarGoogle Scholar
  10. 10 Fine, G.H., Jackson, C.W., and Mclsaac, P.V. Dynamic program behavior under paging. Proc. ACM 21st Nat. Conf. 1966, pp. 223-228. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Frohman-Bentchkowsky, D. The metal-nitride-oxide-silicon (MNOS) transistor---characteristics and applications. Proc. IEEE 58, (Aug. 1970), 1207-1220.Google ScholarGoogle ScholarCross RefCross Ref
  12. 12 Fry, T.C. Probability and Its Engineering Uses (2nd ed.). Van Nostrand, Princeton, N.J., 1965, pp. 399--402.Google ScholarGoogle Scholar
  13. 13 Gaver, D.P. Probability models for multiprogramming computer systems. J. ACM 14, 3 (July 1967), 423-438. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Gibson, D.H. Considerations in block-oriented systems design. Proc. AFIPS 1967 SJCC, Vol. 30, AFIPS Press, Montvale, N.J., pp. 75-80.Google ScholarGoogle Scholar
  15. 15 Hoff, M.E., and Mazor, S. Operation and application of MOS shift registers. Computer Design 10, 2 (Feb. 1971), 57-62.Google ScholarGoogle Scholar
  16. 16 Joseph, M. An analysis of paging and program behavior. Computer J. 13, 1 (Feb. 1970), 48-54.Google ScholarGoogle ScholarCross RefCross Ref
  17. 17 Kosonocky, W.F., and Carnes, J.G. Charge-coupled and carrier-domain devices. IEEE Internat. Solid-State Circuits Conf., Digest Tech. Papers, 1971, pp. 162-163.Google ScholarGoogle Scholar
  18. 18 Kuehner, C.J., and Randell, B. Demand paging in perspective. Proc. AFIPS 1968 FJCC, Vol. 33, AFIPS Press, Montvale, N.J., pp. 1011-1018.Google ScholarGoogle Scholar
  19. 19 Liptay, J.S. The cache, lBMSystems J. 7,1 (1968), 15-21.Google ScholarGoogle Scholar
  20. 20 Lohman, R.D., Mezrich, R.S., and Stewart, W.C. Holographic mass memory's promise: megabits accessible in microseconds. Electronics44 (Jan. 18, 1971), 61-66.Google ScholarGoogle Scholar
  21. 21 Neale, R.G., Nelson, D.L., and Moore, G.E. Nonvolatile and reprogramable, the read-mostly memory is here. Electronics 43 (Sept. 28, 1970), 56-60.Google ScholarGoogle Scholar
  22. 22 Nelson, D.L. Ovonic device applications. J. Non-Crystalline Solds 2 (1970), 528-539.Google ScholarGoogle ScholarCross RefCross Ref
  23. 23 Rajchman, J.A. Promise of optical memories. J. Applied Physics 41, 3 (Mar. 1970), 1376-1383.Google ScholarGoogle ScholarCross RefCross Ref
  24. 24 Rajchman, J.A. An optical read-write mass memory. Applied Optics, 9, 10 (Oct. 1970), 2269-2271.Google ScholarGoogle ScholarCross RefCross Ref
  25. 25 Randell, B., and Kuehner, C.J. Dynamic storage allocation systems. Comm. ACM 11, 5 (May 1968), 297-306. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26 Votaw, D.F, and Stover, A.M. Queuing systems with bounded waiting-line length. Operations Research 14 (1966), 317-328.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 Wallmark, J.T., and Scott, J.H. Switching and storage characteristics of MIS memory transistors. RCA Rev. 30, 2 (June 1969), 335-365.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 16, Issue 4
    April 1973
    62 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/362003
    Issue’s Table of Contents

    Copyright © 1973 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 April 1973

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader