Sequence interlocking and priority apparatus
    1.
    发明授权
    Sequence interlocking and priority apparatus 失效
    序列互连和优先设备

    公开(公告)号:US3675217A

    公开(公告)日:1972-07-04

    申请号:US3675217D

    申请日:1969-12-23

    Applicant: IBM

    CPC classification number: G06F13/18 G06F12/0862

    Abstract: Described is a sequence interlock generator and priority apparatus combination suitable for use in a storage control system for a two-level storage, wherein the storage system includes a high-speed storage against which requests for data are processed and a slower, larger-capacity main storage. Requests can be received and serviced concurrently at a plurality of request ports in the system where they are buffered in request stacks. A tag storage serves as an index to the data currently resident in high-speed storage and a directory storage acts as an index to data currently in main storage. The sequence interlock generator interlocks requests in the plurality of request stacks to insure that requests to the same storage area are performed in proper sequence to insure data integrity. A sequence interlock vector is computed when the request first enters its request port and is appended to the request until the request is clear to request service. A request is received in terms of a logical address. The logical address is transformed into a plurality of physical addresses in high-speed storage. The physical addresses are used to address corresponding tags from the tag storage to determine the contents of the desired addresses in high-speed storage. The priority apparatus essentially splits the request into two priority determinations, one for priority to access the tag storage and the second for priority to access the data storage. The ideal situation is for tags and storage to be accessed concurrently. However, the invention makes provision for action to begin upon the tags if the tag storage can be accessed due to conflicts for accessing the addressable entity in highspeed storage. As a consequence of the invention, initiation of service of a given request is begun at the earliest possible time.

    Abstract translation: 描述了适用于两级存储的存储控制系统中的序列联锁发生器和优先级装置组合,其中存储系统包括高速存储器,对数据进行处理的高速存储器和较慢的较大容量的主存储器 存储。 可以在系统中的多个请求端口并发地接收和服务请求,其中它们被请求堆栈中缓冲。 标签存储器用作当前驻留在高速存储器中的数据的索引,并且目录存储器充当当前在主存储器中的数据的索引。 序列联锁发生器互锁多个请求堆栈中的请求,以确保以适当顺序执行对相同存储区域的请求以确保数据完整性。 当请求首先进入其请求端口并附加到请求时,计算序列互锁向量,直到请求清楚地请求服务为止。 根据逻辑地址接收请求。 逻辑地址被转换成高速存储器中的多个物理地址。 物理地址用于从标签存储器寻址相应的标签,以确定高速存储器中所需地址的内容。 优先级设备基本上将请求分成两个优先级确定,一个优先级用于访问标签存储,另一个优先级用于访问数据存储。 理想的情况是同时访问标签和存储。 然而,如果由于在高速存储器中访问可寻址实体的冲突而能够访问标签存储,本发明提供了开始标签的动作。 作为本发明的结果,给定请求的服务的启动在最早的时间开始。

    Storage control system
    2.
    发明授权

    公开(公告)号:US3670309A

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

    申请号:US3670309D

    申请日:1969-12-23

    Applicant: IBM

    CPC classification number: G06F12/0857 G06F13/18

    Abstract: Described is a storage control system for a two-level storage system. The system includes a high-speed storage against which requests for data are processed and a slower, larger-capacity main storage. Requests for data are received in terms of logical addresses. Requests can be received concurrently at a plurality of request ports where they are buffered in request stacks. A tag storage serves as an index to the data currently resident in high-speed storage, and a directory storage acts as an index to data currently in main storage. A sequence interlock generator is included which interlocks requests in the plurality of request stacks to insure that requests to the same storage area are performed in proper sequence to insure data integrity. When a request is serviced, the logical address is transformed into a plurality of physical addresses in high-speed storage. The corresponding tags from the tag storage and the corresponding data from the high-speed storage are concurrently fetched. A comparison is made of the tags with the transformed address to determine whether the requested data is in high-speed storage. Since request to the same storage entity in high-speed storage or tag storage can be made concurrently by all request ports, conflict resolvers are included to resolve conflicts arising from simultaneous requests to either of these two storages. High-speed storage is divided into storage modules capable of simultaneous operation such that requests from the plurality of request ports can be serviced concurrently. If comparison of the tags indicate that the requested data is available, the request is serviced. An interstorage transfer mechanism is included such that if the requested data is not available in high-speed storage, then the data is retrieved from main storage and placed into high-speed storage for subsequent processing of the request. Concurrently with interstorage transfer, processing of other requests from the request ports is permissible. In the replacement of data from main storage to high-speed storage, provision is made for also replacing data from high-speed storage to main storage if such be necessary.

    Pseudo-random code implemented variable block-size storage mapping device and method
    4.
    发明授权
    Pseudo-random code implemented variable block-size storage mapping device and method 失效
    PSEUDO随机代码实现可变块大小存储映射设备和方法

    公开(公告)号:US3675215A

    公开(公告)日:1972-07-04

    申请号:US3675215D

    申请日:1970-06-29

    Applicant: IBM

    CPC classification number: G06F12/1063 G06F12/1027 G06F2212/652

    Abstract: A directory, or index, of variable-sized pages of data for use in a two-level storage system employing virtual addressing, wherein data is stored in a large capacity main storage and retrieved to a smaller, faster buffer storage for processing. If a desired piece of data indicated by a virtual address is not currently resident in buffer storage, the location of the beginning of the page containing that data in main storage is found by searching the directory. Directory addresses for searching the directory are formed by a pseudo-random function of two parameters, the virtual address and a count. Since a larger page-size entry will be addressed statistically more frequently than a smaller page-size entry, a new directory entry for a given page size is made in the first location along its algorithm chain which currently contains either an invalid entry or a smaller page-size entry. Thus, it may be necessary to relocate a smaller page-size entry further down its chain.

    Abstract translation: 用于在采用虚拟寻址的两级存储系统中使用的可变大小的数据页面的目录或索引,其中数据存储在大容量主存储器中并且被检索到较小的较快的缓冲存储器中用于处理。 如果由虚拟地址指示的期望的数据片段当前不存在于缓冲存储器中,则通过搜索目录来找到包含主存储器中的该数据的页面开始位置。 用于搜索目录的目录地址由两个参数的伪随机函数形成,即虚拟地址和计数。 由于较大的页面大小的条目将在统计上比较小的页面大小的条目更频繁地被寻址,所以在沿其算法链的第一个位置中,给定给定的页面大小的新的目录条目当前包含无效条目或较小的页面大小条目 页面大小的条目。 因此,可能需要将较小的页面大小的条目进一步向下移动到其链条上。

    Interstorage transfer mechanism
    5.
    发明授权
    Interstorage transfer mechanism 失效
    室内传输机制

    公开(公告)号:US3670307A

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

    申请号:US3670307D

    申请日:1969-12-23

    Applicant: IBM

    CPC classification number: G06F12/0804

    Abstract: Described is an interstorage transfer mechanism suitable for use in a storage control system for a two-level storage, wherein the storage system includes a high-speed storage against which requests for data are processed and a slower, larger-capacity main storage. Requests can be received and serviced concurrently at a plurality of request ports in the system where they are buffered in the request stacks. A tag storage serves as an index to the data concurrently resident in high-speed storage and a directory storage acts as an index to data currently in main storage. Requests for data in each port cause the tag storage to be interrogated to determine whether the desired data is in highspeed storage. If not, then the desired data is retrieved from main storage and placed into high-speed storage by the interstorage transfer mechanism. Priority means for accessing said high-speed storage are provided, said interstorage transfer mechanism being given first priority to access said high-speed and tag storages in case of conflicts in access between said interstorage transfer mechanism and at least one of said plurality of request ports. Means are provided for choosing a target address in High-speed storage wherein said desired data will be relocated. The tag indexing said target address is updated by said interstorage transfer mechanism to reflect the new data. Means are further provided for invalidating all requests currently in transit at the time said tag is changed to insure data integrity in case said requests refer to old data in said target line. The aforementioned tags contain a bit indicating that the corresponding address in high-speed storage has recently been accessed. Cold generator means are provided for periodically resetting this bit in each tag to mark the corresponding high-speed storage physical address as a candidate for replacement target.

    Abstract translation: 描述了适用于两级存储的存储控制系统中的存储间传送机制,其中存储系统包括处理数据请求的高速存储器和较慢容量较大的主存储器。 可以在系统中的多个请求端口并发地接收和服务请求,其中它们被缓存在请求堆栈中。 标签存储用作同时驻留在高速存储器中的数据的索引,并且目录存储器充当当前在主存储器中的数据的索引。 每个端口中的数据请求会导致询问标签存储,以确定所需数据是否处于高速存储。 如果不是,则从主存储器检索所需的数据,并通过机架间传送机制将其置于高速存储器中。 提供了用于访问所述高速存储器的优先级装置,所述存储间传送机制被赋予第一优先权以在所述间间传送机制与所述多个请求端口中的至少一个之间的访问冲突的情况下访问所述高速和标签存储 。 提供了用于在高速存储器中选择目标地址的装置,其中所述所需数据将被重新定位。 所述目标地址索引的标签由所述区间传送机制更新以反映新的数据。 进一步提供用于在所述标签被改变时使当前正在传输的所有请求无效的装置,以在所述请求涉及所述目标行中的旧数据的情况下确保数据完整性。 上述标签包含一个指示最近已经访问了高速存储器中的相应地址的位。 提供冷发生器装置,用于周期性地复位每个标签中的该位,以将相应的高速存储物理地址标记为替换目标的候选。

Patent Agency Ranking