会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for efficient updating of CKD data stored on fixed
block architecture devices
    • 用于有效更新存储在固定块体系结构设备上的CKD数据的方法和装置
    • US5535372A
    • 1996-07-09
    • US271335
    • 1994-07-06
    • Michael T. BenhaseDavid A. BurtonJohn N. McCauley, Jr.Robert L. Morton
    • Michael T. BenhaseDavid A. BurtonJohn N. McCauley, Jr.Robert L. Morton
    • G06F3/06G11B5/09
    • G06F3/0613G06F3/064G06F3/0674
    • A method and apparatus for updating CKD data stored on fixed block media, and more particularly to creating Track Format Descriptors which are data structures loaded into electronic memory to enable fast writing of data without loading an entire CKD emulated track of data into memory. A control unit is provided with logic to provide Track Format Descriptors which describe the format of the track without the need for the data content of the track to be resident in cache, or electronic memory. An emulated CKD volume corresponds to a volume of data stored on a multi-disk device. Each track on a volume is represented by a Track Format Descriptor. The Track Format Descriptor forms a representation of the format according to the following general procedure. If the format is a predefined format, in other words one that is already known by the control unit then a track form descriptor is formed to represent the format. If the format is easily discernible, it is said to be "well behaved". "Well behaved" formats are ones in which either each record has the same field length, there is no key field, or record numbers start at one and increment by one. A Track Format Descriptor is formed by predicting the format of these so called "well behaved" formats. If the format is not "well behaved" and the format has not been predefined, then the entire data track must be loaded into cache memory, before a fast write operation is performed. The Track Format Descriptor serves as an index to other information data structures which are loaded into memory when required by logic in the control unit.
    • 一种用于更新存储在固定块介质上的CKD数据的方法和装置,更具体地说,涉及创建作为加载到电子存储器中的数据结构的轨道格式描述符,以便能够快速写入数据,而无需将整个CKD仿真数据轨迹加载到存储器中。 控制单元被提供有逻辑以提供描述轨道格式的轨道格式描述符,而不需要轨道的数据内容驻留在高速缓存或电子存储器中。 仿真的CKD卷对应于存储在多盘设备上的数据量。 卷上的每个曲目由轨道格式描述符表示。 轨道格式描述符根据以下一般程序形成格式的表示。 如果格式是预定义的格式,换句话说是由控制单元已知的格式,则形成轨迹形式描述符来表示格式。 如果格式很容易识别,那么它被称为“表现良好”。 “行为良好”的格式是每个记录具有相同的字段长度,没有键字段,或记录号从一个开始并递增一个。 轨道格式描述符是通过预测所谓的“良好行为”格式的格式形成的。 如果格式不是“良好的行为”,并且格式尚未预定义,则在执行快速写入操作之前,必须将整个数据轨道加载到高速缓存中。 轨道格式描述符用作其他信息数据结构的索引,其在控制单元中的逻辑需要时被加载到存储器中。
    • 3. 发明授权
    • Handling high priority requests in a sequential access storage device having a non-volatile storage cache
    • 在具有非易失性存储高速缓存的顺序存取存储设备中处理高优先权请求
    • US08996789B2
    • 2015-03-31
    • US13411159
    • 2012-03-02
    • Michael T. BenhaseLokesh M. Gupta
    • Michael T. BenhaseLokesh M. Gupta
    • G06F12/00G06F12/08
    • G06F12/0804G06F12/0868G06F12/0897G06F2212/1016G06F2212/225G06F2212/285G06F2212/312
    • Modified tracks for write requests to a sequential access storage medium in a sequential access storage device are cached in a non-volatile storage, which is a faster access device than the sequential access storage medium. A request queue includes destage requests to destage the modified tracks in the non-volatile storage device to the sequential access storage medium and read requests to access read requested tracks from the sequential access storage medium. A comparison is made of a current position of a read/write mechanism with respect to physical locations on the sequential access storage medium of the tracks subject to the destage requests indicated in the request queue. A determination is made of one of the destage requests to process based on the comparison. The modified track for the determined destage request is written from the non-volatile storage device to the sequential access storage medium.
    • 用于向顺序访问存储设备中的顺序访问存储介质的写请求的修改轨道被缓存在非易失性存储器中,该非易失性存储器是比顺序访问存储介质更快的访问设备。 请求队列包括将非易失性存储设备中的经修改的轨道去往顺序存取存储介质并读取从顺序访问存储介质访问读请求的轨道的请求的到达请求。 比较读/写机构相对于在请求队列中指示的流出请求的轨道的顺序存取介质上的物理位置的当前位置。 根据比较确定要处理的要求之一。 用于确定的流出请求的经修改的轨道从非易失性存储设备写入顺序存取存储介质。
    • 9. 发明授权
    • Adjusting location of tiered storage residence based on usage patterns
    • 根据使用模式调整分层存储住宅的位置
    • US08880835B2
    • 2014-11-04
    • US12498424
    • 2009-07-07
    • Michael T. BenhaseAndrew D. Walls
    • Michael T. BenhaseAndrew D. Walls
    • G06F12/16G06F11/34G06F3/06
    • G06F11/3485G06F3/061G06F3/0649G06F3/0688G06F2201/88
    • Mechanisms for managing data segments in a tiered storage system are provided. The mechanisms maintain at least one counter for each data segment in the tiered storage system. Each counter in the at least one counter counts a number of access operations to a corresponding data segment for a predetermined time interval. The mechanisms further perform one or more analytical operations based on one or more values of the at least one counter for each data segment to make residence determinations for each data segment. The mechanisms also adjust a storage location of one or more data segments in tiers of the tiered storage system to thereby move the one or more data segments to appropriate tiers of the tiered storage system based on results of the one or more analytical operations.
    • 提供了在分层存储系统中管理数据段的机制。 这些机制为分层存储系统中的每个数据段维护至少一个计数器。 所述至少一个计数器中的每个计数器对预定时间间隔对相应的数据段进行多次访问操作。 所述机构还基于每个数据段的所述至少一个计数器的一个或多个值进行一个或多个分析操作,以对每个数据段进行居住确定。 这些机制还调整分层存储系统的层中的一个或多个数据段的存储位置,从而基于一个或多个分析操作的结果将一个或多个数据段移动到分层存储系统的适当层。