会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Techniques for managing placement of extents based on a history of active extents
    • 基于有效范围的历史来管理扩展区的布局的技术
    • US08782324B1
    • 2014-07-15
    • US13536371
    • 2012-06-28
    • Xiangping ChenPhilippe Armangau
    • Xiangping ChenPhilippe Armangau
    • G06F12/02G06F12/08
    • G06F12/0238G06F3/0608G06F3/0611G06F3/0644G06F3/0649G06F3/0665G06F3/0688
    • A technique of managing data placement involves constructing an active extent list which identifies active extents stored in a storage pool based on a history of extent activity. The technique further involves based on the active extent list, generating preferred extent-tier pairings for extents of a particular LUN slice that are initially stored on a first tier of the pool, the preferred extent-tier pairings matching (i) a first extent of that LUN slice to the first tier and (ii) a second extent of that LUN slice to a second tier of the pool. The technique further involves, based on the preferred extent-tier pairings, maintaining the first extent on the first tier and relocating the second extent from the first tier to the second tier to distribute the first and second extents of that LUN slice across multiple tiers of the pool in accordance with the extent activity history.
    • 管理数据放置的技术包括构建基于范围活动的历史来识别存储在存储池中的活动盘区的活动盘区列表。 该技术进一步涉及基于活动范围列表,为最初存储在池的第一层上的特定LUN片段的范围生成优选的范围级配对,优选的扩展级配对匹配(i)第一范围 该LUN切片到第一层,以及(ii)该LUN切片的第二范围到该池的第二层。 该技术进一步涉及基于优选的范围 - 层配对,将第一范围维护在第一层上,并将第二范围从第一层重定位到第二层,以将该LUN切片的第一和第二范围分布在多层 游泳池按照活动历史的程度。
    • 4. 发明授权
    • Techniques for managing deduplication based on recently written extents
    • 基于最近写入的范围来管理重复数据消除的技术
    • US08799601B1
    • 2014-08-05
    • US13536375
    • 2012-06-28
    • Xiangping ChenPhilippe Armangau
    • Xiangping ChenPhilippe Armangau
    • G06F12/00G06F12/16
    • G06F3/067G06F3/0608G06F3/0641
    • A technique is directed to managing deduplication of extents in a data storage apparatus having processing circuitry and memory which stores the extents (e.g., blocks). The technique involves constructing, by the processing circuitry, a recently written extent list which identifies recently written extents stored within the memory. The technique further involves referencing the recently written extent list to bypass (or skip over) extents identified by the recently written extent list when obtaining a candidate extent for possible deduplication. The technique further involves processing the candidate extent for possible deduplication. Here, by identifying frequently overwritten extents on the recently written extent list, the data storage apparatus is able to easily avoid cycles of deduplicating and subsequently splitting frequently overwritten extents.
    • 一种技术涉及在具有存储区段(例如,块)的处理电路和存储器的数据存储设备中管理盘区的重复数据删除。 该技术涉及由处理电路构建最近写入的盘区列表,其识别存储在存储器内的最近写入的盘区。 该技术还涉及参考最近写入的范围列表来绕过(或跳过)最近写入的盘区列表识别的盘区,以获得可能重复数据删除的候选盘区。 该技术还涉及处理可能的重复数据删除的候选扩展。 这里,通过在最近写入的盘区列表中识别频繁重写的盘区,数据存储装置能够容易地避免重复数据删除的循环,并随后分割经常重写的盘区。
    • 9. 发明授权
    • Methods and apparatus for scheduling an action on a computer
    • 用于在计算机上调度动作的方法和装置
    • US07636704B2
    • 2009-12-22
    • US11213565
    • 2005-08-26
    • Philippe ArmangauStephen J. Todd
    • Philippe ArmangauStephen J. Todd
    • G06F7/00G06F17/30
    • G06F3/0683G06F3/0605G06F3/0647G06F17/30085Y10S707/99931
    • One embodiment is directed to a computer system that includes primary and secondary storage systems. When a request to store a content unit is received, it may be determined whether to store the content unit on the primary storage system or the secondary storage system. In another embodiment, a computer may store information relating to an action to be performed in one of the directories of a file system that corresponds to a period of time. When the period of time to which the directory corresponds arrives, the action may be performed. In another embodiment, a content unit stored on a primary storage system may be copied to a secondary storage system in a computer system. After the content unit has been copied, the secondary storage system may send a delete request to the primary storage system to delete the content unit from the primary storage system.
    • 一个实施例涉及包括主存储系统和辅助存储系统的计算机系统。 当接收到存储内容单元的请求时,可以确定是否将内容单元存储在主存储系统或辅助存储系统上。 在另一个实施例中,计算机可以存储与在一段时间内对应的文件系统的目录之一中要执行的动作有关的信息。 当目录对应的时间段到达时,可以执行动作。 在另一个实施例中,存储在主存储系统上的内容单元可以被复制到计算机系统中的辅助存储系统。 在内容单元被复制之后,辅助存储系统可以向主存储系统发送删除请求以从主存储系统中删除内容单元。
    • 10. 发明申请
    • Methods and apparatus for storing content in a file system
    • 用于在文件系统中存储内容的方法和装置
    • US20060294115A1
    • 2006-12-28
    • US11165102
    • 2005-06-23
    • Philippe ArmangauStephen Todd
    • Philippe ArmangauStephen Todd
    • G06F7/00
    • G06F16/13
    • One embodiment of the invention is directed to the containerization of content units that are accessed using an identifier. Applicants have appreciated that file systems sometimes impose limits on the number of files that may be stored therein that are too restrictive. Thus, in one embodiment, multiple content units may be stored in a single file, called a container file, in a file system. Each content unit may have an identifier associated with it. When an accessing entity requests access to a previously-stored content unit and provides the identifier for the content unit, the identifier may be used to locate the container file in which the content unit is stored.
    • 本发明的一个实施例涉及使用标识符访问的内容单元的容器化。 申请人已经意识到,文件系统有时限制可能存储在其中的太多限制的文件数量。 因此,在一个实施例中,多个内容单元可以被存储在文件系统中的被称为容器文件的单个文件中。 每个内容单元可以具有与其相关联的标识符。 当访问实体请求访问先前存储的内容单元并提供内容单元的标识符时,可以使用该标识符来定位其中存储内容单元的容器文件。