Dynamically ordered magnetic bubble shift register memory
    1.
    发明授权
    Dynamically ordered magnetic bubble shift register memory 失效
    动态订购磁浮动寄存器存储器

    公开(公告)号:US3670313A

    公开(公告)日:1972-06-13

    申请号:US3670313D

    申请日:1971-03-22

    Applicant: IBM

    CPC classification number: G06F7/78 G11C19/0875

    Abstract: This specification discloses a bubble domain memory in which data is arranged for immediacy of access in accordance with its last use. The memory comprises a plurality of parallel shift registers in which data can be accessed in parallel. In other words, each of the shift registers contains a bit of a page or word so that by the performance of one shifting operation all of the bits of the page or word can be accessed. Data in each shift register is arranged in its order of last use so that the access position K of a shift register having K bit positions contains the last bit of information used and the position K-1 preceding the access position K in the shift register contains the bit of data used just previously to the data in the access position K and so on. In these shift registers the shift positions are arranged in loops for shifting the data between the positions of the shift register. Two such loops are provided, one of the loops contains all the shift positions so that data in any position in the shift register can be shifted into the access position K of the register for reading or writing. The other loop contains all the positions of the shift register but the access position K. This second loop is for reordering the data in the shift register in order of last use after data has been shifted into the access position K for reading or writing by the first loop.

    Abstract translation: 本说明书公开了一种气泡域记忆,其中数据被安排用于根据其最后使用的即时性。 存储器包括多个并行移位寄存器,其中可并行访问数据。 换句话说,每个移位寄存器包含页或字的位,使得通过执行一个移位操作,可以访问页面或单词的所有位。 每个移位寄存器中的数据以其最后使用的顺序排列,使得具有K位位置的移位寄存器的访问位置K包含所使用的信息的最后位,移位寄存器中存取位置K之前的位置K-1包含 刚才使用的数据位在访问位置K中的数据等等。 在这些移位寄存器中,移位位置被布置成用于在移位寄存器的位置之间移位数据。 提供了两个这样的环路,其中一个环路包含所有移位位置,使得移位寄存器中任何位置的数据都可以移入寄存器的访问位置K进行读取或写入。 另一个环路包含移位寄存器的所有位置,但存在访问位置K.该第二循环用于在数据已经被移入访问位置K之后按照上次使用顺序重新排序移位寄存器中的数据,以便通过读取或写入 第一个循环。

Patent Agency Ranking