会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 72. 发明授权
    • SYNTHETIC BACKUPS WITHIN DEDUPLICATION STORAGE SYSTEM
    • 合成背包内的重复存储系统
    • EP2646915B1
    • 2017-09-13
    • EP11787825.6
    • 2011-11-16
    • International Business Machines Corporation
    • ARONOVICH, LiorTOAFF, YairHIRSCH, Michael
    • G06F11/14G06F17/30
    • G06F17/30156G06F11/1453G06F17/3033G06F17/30489G06F17/30997
    • A deduplication storage system enables new input data to be deduplicated with data of synthetic backups already constructed, and for this purpose efficiently calculates deduplication digests for synthetic backups being constructed, based on already existing digests of data referenced by the synthetic backups. For each input data segment of the plurality of input data segments of a synthetic backup being constructed, a plurality of deduplication digests of stored data segments, referenced by the input data segment, is retrieved from an index. Each input data segment is partitioned into each of a plurality of fixed-sized data sub-segments. A calculation is performed producing a deduplication digest for a data sub-segment, where the calculation is based on the retrieved deduplication digests of the plurality of stored data sub-segments referenced by the input data sub-segment.
    • 重复数据删除存储系统可以使用已经构建的合成备份的数据对新的输入数据进行重复数据删除,并为此基于合成备份所引用的已有数据摘要,有效地计算正在构建的合成备份的重复数据删除摘要。 对于构建的合成备份的多个输入数据段中的每个输入数据段,从索引中检索由输入数据段引用的存储的数据段的多个重复数据删除摘要。 每个输入数据段被分割成多个固定大小的数据子段中的每一个。 执行计算以产生数据子片段的重复数据删除摘要,其中该计算基于由输入数据子片段参考的多个存储的数据子片段的检索到的重复数据删除摘要。
    • 76. 发明授权
    • A SPIRAL CACHE MEMORY AND METHOD OF OPERATING A SPIRAL CACHE MEMORY
    • 一种螺旋高速缓存存储器和一种操作螺旋高速缓存存储器的方法
    • EP2353095B1
    • 2017-06-14
    • EP09752796.4
    • 2009-11-10
    • International Business Machines Corporation
    • STRUMPEN, VolkerFRIGO, Matteo
    • G06F12/0897G06F12/123
    • G06F12/123G06F12/0897G06F2212/271Y02D10/13
    • A memory provides reduction in access latency for frequently-accessed values by self-organizing to always move a requested value to a front-most central storage element of a spiral. The occupant of the central location is swapped backward, which continues backward through the spiral until an empty location is swapped-to, or the last displaced value is cast out of the last location in the spiral. The elements in the spiral may be cache memories or single elements. The resulting cache memory is self-organizing and for the one-dimensional implementation has a worst-case access time proportional to N, where N is the number of tiles in the spiral. A k-dimensional spiral cache has a worst-case access time proportional to N1/k. Further, a spiral cache system provides a basis for a non-inclusive system of cache memory, which reduces the amount of space and power consumed by a cache memory of a given size.
    • 存储器通过自组织来减少对频繁访问的值的访问延迟,以始终将请求的值移动到螺旋的最前面的中央存储元件。 中央位置的居住者向后交换,后者继续向后穿过螺旋,直到空位交换为止,或者最后一个位移值从螺旋中的最后位置逐出。 螺旋中的元素可能是高速缓存或单个元素。 由此产生的高速缓冲存储器是自组织的,并且对于一维实现具有与N成比例的最坏情况访问时间,其中N是螺旋中的瓦片的数量。 k维螺旋缓存具有与N1 / k成比例的最坏情况访问时间。 此外,螺旋高速缓存系统为高速缓存存储器的非包含系统提供了基础,这减少了给定大小的高速缓存存储器所消耗的空间和功率量。