公开(公告)号：US3766534A

公开(公告)日：1973-10-16

申请号：US3766534D

申请日：1972-11-15

Applicant: IBM

Inventor： BEAUSOLEIL W ,  PHELPS B

IPC: G11C19/00 ,  G06F7/78 ,  G06F12/00 ,  G11C7/00 ,  G11C15/04 ,  G11C19/18 ,  G11C19/28

CPC classification number: G06F7/78 ,  G11C15/04 ,  G11C19/188 ,  G11C19/287

Abstract: A data storage unit in which words of data including the word addresses are stored in groups of shiftable matrices, the groups of matrices being operable on a signal requesting access to repetitively shift their contents to other matrix positions in various loops, some of which include a position from which a word may be accessed and some of which exclude the access position. The bits in a data word are distributed among groups of matrices, each group generally containing only one bit of a given word. Each group is logically divided into a plurality of sectors, with each sector containing bits from several words. Controls are provided for varying the shifting in the various loops such that the positions of some or all of the sectors are dynamically reordered so that the proximity of each of the sectors to the access position is approximately or exactly the order in which the sectors were last requested, and so that the word bits within the sectors are also positioned so that their proximity to the access position is approximately or exactly the order in which they were last requested, thus reducing average access time in programs involving considerable repeated reference to a limited group of sectors and/or words in the memory, and substantially reducing worst-case access time for all situations.

Abstract translation: 一种数据存储单元，其中包括字地址的数据的字被存储在可移位矩阵的组中，所述矩阵组可以在请求访问的信号上操作以将它们的内容重复地移动到各种循环中的其他矩阵位置，其中一些包括 可以访问单词的位置，其中一些排除访问位置。 数据字中的位分布在矩阵组中，每组通常只包含给定字的一个位。 每组逻辑上划分为多个扇区，每个扇区包含来自多个单词的位。 提供控制以改变各种环路中的移位，使得部分或全部扇区的位置被动态重新排序，使得每个扇区到访问位置的接近度大致或恰好是扇区最后的顺序 并且使得扇区中的字位也被定位成使得它们与访问位置的接近度近似或恰好地是它们最后请求的顺序，从而减少涉及相当多地重复引用有限组的程序中的平均访问时间 的存储器中的扇区和/或字，并且大大减少了所有情况下的最坏情况访问时间。