Certain questions in design of hierarchical shift register memories with flat magnetic domains

The paper is concerned with design of shift register memories which multi-level storage hierarchies, SH. At all levels and between the level the same paging algorithm least recently used, LRU is used. The possibilities of using LRU in shift registers with flat zigzagged and rectilinear magnetic domains are discussed. A procedure for estimating the SH productivity and a numerical example are given.