会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明授权
    • Automatically reclaiming memory space
    • 自动回收内存空间
    • US08438362B2
    • 2013-05-07
    • US12816075
    • 2010-06-15
    • Anirban MukherjeeAnindya BanerjeeDaniel James Fillingham
    • Anirban MukherjeeAnindya BanerjeeDaniel James Fillingham
    • G06F12/00
    • G06F12/0253G06F17/30138
    • A method, in one embodiment, can include determining whether an administrative task for a file system is to be performed within a thin storage memory array. Furthermore, if the administrative task for the file system is to be performed, a determination is made as to whether memory space is freed up while performing the administrative task. If memory space is freed up while performing the administrative task, a determination is made as to whether the freed up memory space satisfies a predefined contiguous memory space threshold. If the predefined contiguous memory space threshold is satisfied by the freed up memory space, a determination is made as to whether a memory space reclamation process is to be performed. If the memory space reclamation process is to be performed, the freed up memory space is reclaimed from the file system.
    • 在一个实施例中,一种方法可以包括确定文件系统的管理任务是否在薄存储存储器阵列内执行。 此外,如果要执行文件系统的管理任务,则确定在执行管理任务时是否释放存储器空间。 如果在执行管理任务时释放存储器空间,则确定释放的存储器空间是否满足预定义的连续存储器空间阈值。 如果通过释放的存储器空间来满足预定义的连续存储器空间阈值,则确定是否要执行存储器空间回收处理。 如果要执行内存空间回收过程,则从文件系统中回收释放的内存空间。
    • 25. 发明申请
    • METHOD AND SYSTEM FOR PROVIDING DEDUPLICATION INFORMATION TO APPLICATIONS
    • 提供应用信息的方法和系统
    • US20110225211A1
    • 2011-09-15
    • US12724222
    • 2010-03-15
    • Anirban MukherjeeAnindya Banerjee
    • Anirban MukherjeeAnindya Banerjee
    • G06F7/00
    • G06F17/30156
    • A method of maintaining and providing information relating to file deduplication. A first portion of a first file and a second portion of a second file that contain a first content are identified. A first header associated with the first portion is created. The first header identifies the first portion and the second portion containing the first content. The first header is appended to a storage location of the first content of the first portion to form a first data structure for the first file. The first data structure is stored. The first data structure is provided to an application requesting the first file so that duplicate data processing can be avoided by the application. The first data structure is updated when the first file or the second file are altered. A similar process may occur to generate a data structure for the second file.
    • 维护和提供与文件重复数据删除相关的信息的方法。 识别包含第一内容的第一文件的第一部分和第二文件的第二部分。 创建与第一部分相关联的第一标题。 第一标题标识包含第一内容的第一部分和第二部分。 第一标题被附加到第一部分的第一内容的存储位置,以形成第一文件的第一数据结构。 存储第一个数据结构。 将第一数据结构提供给请求第一文件的应用程序,以便应用可以避免重复的数据处理。 当第一个文件或第二个文件被更改时,第一个数据结构被更新。 可能会发生类似的过程来生成第二个文件的数据结构。
    • 26. 发明授权
    • Coherency of replicas for a distributed file sharing system
    • 一个分布式文件共享系统的副本的一致性
    • US07831735B1
    • 2010-11-09
    • US12396280
    • 2009-03-02
    • Navin KabraAnindya BanerjeeBijayaLaxmi NandaSivaramakrishna Ramadugu VenkataDilip Madhusudan RanadeRadha ShelatLaxmikant Vithal Gunda
    • Navin KabraAnindya BanerjeeBijayaLaxmi NandaSivaramakrishna Ramadugu VenkataDilip Madhusudan RanadeRadha ShelatLaxmikant Vithal Gunda
    • G06F15/16G06F7/00
    • G06F17/30212G06F17/30165G06F17/30176G06F17/30227Y10S707/99952
    • A plurality of data objects may be replicated across a plurality of computing nodes coupled to a network. The network may include a first node operable to initiate an update operation to update a plurality of replicas of a first object. If one or more of the replicas are not reachable then the update operation may update a subset (e.g., a quorum) but not all of the replicas. For each node on which one of the replicas was updated in the update operation, the node may add the object to a list of incoherent objects. The list of incoherent objects may subsequently be used to bring the lagging replicas in sync with the replicas that were updated. In another embodiment, a plurality of replicas of an object may be stored on a plurality of nodes, similarly as described above. A first node that stores a replica of the object may store a first timestamp associated with the replica on the first node. The timestamp may be used to ensure that the replica on the first node is coherent with respect to one or more other replicas by periodically communicating with the one or more other replicas when a threshold amount of time has passed without the replica on the first node receiving an update.
    • 可以跨耦合到网络的多个计算节点复制多个数据对象。 网络可以包括可操作以发起更新操作以更新第一对象的多个副本的第一节点。 如果一个或多个副本不可达,则更新操作可以更新子集(例如,法定人数),但不能更新所有副本。 对于在更新操作中更新其中一个副本的每个节点,节点可以将对象添加到不相干对象的列表中。 随后可以使用非相干对象的列表将滞后副本与已更新的副本同步。 在另一个实施例中,类似于上述,可以将多个对象的副本存储在多个节点上。 存储对象的副本的第一节点可以在第一节点上存储与副本相关联的第一时间戳。 时间戳可以用于通过在经过第一节点接收到副本的阈值时间段之后通过周期性地与一个或多个其他副本进行通信来确保第一节点上的副本相对于一个或多个其他副本是一致的 更新。
    • 27. 发明授权
    • Coherency of replicas for a distributed file sharing system
    • 一个分布式文件共享系统的副本的一致性
    • US07500020B1
    • 2009-03-03
    • US10749365
    • 2003-12-31
    • Navin KabraAnindya BanerjeeBijayaLaxmi NandaSivaramakrishna Ramadugu VenkataDilip Madhusudan RanadeRadha ShelatLaxmikant Vithal Gunda
    • Navin KabraAnindya BanerjeeBijayaLaxmi NandaSivaramakrishna Ramadugu VenkataDilip Madhusudan RanadeRadha ShelatLaxmikant Vithal Gunda
    • G06F15/16G06F12/00
    • G06F17/30212G06F17/30165G06F17/30176G06F17/30227Y10S707/99952
    • A plurality of data objects may be replicated across a plurality of computing nodes coupled to a network. The network may include a first node operable to initiate an update operation to update a plurality of replicas of a first object. If one or more of the replicas are not reachable then the update operation may update a subset (e.g., a quorum) but not all of the replicas. For each node on which one of the replicas was updated in the update operation, the node may add the object to a list of incoherent objects. The list of incoherent objects may subsequently be used to bring the lagging replicas in sync with the replicas that were updated. In another embodiment, a plurality of replicas of an object may be stored on a plurality of nodes, similarly as described above. A first node that stores a replica of the object may store a first timestamp associated with the replica on the first node. The timestamp may be used to ensure that the replica on the first node is coherent with respect to one or more other replicas by periodically communicating with the one or more other replicas when a threshold amount of time has passed without the replica on the first node receiving an update.
    • 可以跨耦合到网络的多个计算节点复制多个数据对象。 网络可以包括可操作以发起更新操作以更新第一对象的多个副本的第一节点。 如果一个或多个副本不可达,则更新操作可以更新子集(例如,法定人数),但不能更新所有副本。 对于在更新操作中更新其中一个副本的每个节点,节点可以将对象添加到不相干对象的列表中。 随后可以使用非相干对象的列表将滞后副本与已更新的副本同步。 在另一个实施例中,类似于上述,可以将多个对象的副本存储在多个节点上。 存储对象的副本的第一节点可以在第一节点上存储与副本相关联的第一时间戳。 时间戳可以用于通过在经过第一节点接收到副本的阈值时间段之后通过周期性地与一个或多个其他副本进行通信来确保第一节点上的副本相对于一个或多个其他副本是一致的 更新。