Hierarchical data storage system
作者： Philip Broughton
DOI:
关键词:
摘要: A cache store (10) is provided in conjunction with a main (2). Each location of the has changed bit (CH). list (4) maintained addresses those locations which have been modified. When becomes full, entry at head read out and corresponding data item transferred from to Thus, there are never more than limited number items awaiting transfer. To clear all modified items, each turn The system reduces amount traffic between (2) hence improves efficiency.
lens.org 参考文章(10)
Thomas F. Joyce, First in first out activity queue for a cache store ,(1977)
Gerrit Adriaan Spoelder, Storage system comprising a main store and a buffer store ,(1974)
Iver C Hansen, Reinhard K Kronies, Apparatus for exchanging information between a high-speed memory and a low-speed memory ,(1970)
Arnold Weinberger, Louis R. Bryant, Raymond J. Pedersen, Circuit for implementing a modified lru replacement algorithm for a cache ,(1975)
Robert A. Healey, Everett M. Shimp, Stack mechanism for a data processor ,(1974)
Richard E. Matick, Computer storage systems and technology ,(1977)
Michel Moussie, Bipolar programmable read only memory with fusible links ,(1975)
Natsui Yoshinobu, Kusunose Norio, Mayumi Hiroshi, Programmable read only memory integrated circuit device ,(1977)
Edson Bruce A, Cordi Vincent A, SYSTEME A MEMOIRES HIERARCHISEES ,(1976)