会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • 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.
    • 可以跨耦合到网络的多个计算节点复制多个数据对象。 网络可以包括可操作以发起更新操作以更新第一对象的多个副本的第一节点。 如果一个或多个副本不可达,则更新操作可以更新子集(例如,法定人数),但不能更新所有副本。 对于在更新操作中更新其中一个副本的每个节点,节点可以将对象添加到不相干对象的列表中。 随后可以使用非相干对象的列表将滞后副本与已更新的副本同步。 在另一个实施例中,类似于上述,可以将多个对象的副本存储在多个节点上。 存储对象的副本的第一节点可以在第一节点上存储与副本相关联的第一时间戳。 时间戳可以用于通过在经过第一节点接收到副本的阈值时间段之后通过周期性地与一个或多个其他副本进行通信来确保第一节点上的副本相对于一个或多个其他副本是一致的 更新。
    • 5. 发明授权
    • 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.
    • 可以跨耦合到网络的多个计算节点复制多个数据对象。 网络可以包括可操作以发起更新操作以更新第一对象的多个副本的第一节点。 如果一个或多个副本不可达,则更新操作可以更新子集(例如,法定人数),但不能更新所有副本。 对于在更新操作中更新其中一个副本的每个节点,节点可以将对象添加到不相干对象的列表中。 随后可以使用非相干对象的列表将滞后副本与已更新的副本同步。 在另一个实施例中,类似于上述,可以将多个对象的副本存储在多个节点上。 存储对象的副本的第一节点可以在第一节点上存储与副本相关联的第一时间戳。 时间戳可以用于通过在经过第一节点接收到副本的阈值时间段之后通过周期性地与一个或多个其他副本进行通信来确保第一节点上的副本相对于一个或多个其他副本是一致的 更新。
    • 6. 发明授权
    • Fault tolerant multi-stage data replication with relaxed coherency guarantees
    • 具有轻松一致性保证的容错多级数据复制
    • US07653668B1
    • 2010-01-26
    • US11286619
    • 2005-11-23
    • Radha ShelatDilip Madhusudan RanadeNavin KabraBijayaLaxmi NandaAnindya Banerjee
    • Radha ShelatDilip Madhusudan RanadeNavin KabraBijayaLaxmi NandaAnindya Banerjee
    • G06F17/30
    • G06F17/30212G06F11/2094
    • A system for fault tolerant multi-stage data replication with relaxed coherency comprises one or more processors and memory coupled to the processors, where the memory stores program instructions executable by the processors to implement a data replication service. In response to an update request directed at a data object, in a first stage of replication, the data replication service is configured to update respective primary replicas at a plurality of primary replica sites for the data object, and to store metadata descriptors at each of the plurality of primary replica sites. The data replication service is configured to determine whether a notification of the update is to be sent to any other replica sites. In response to identifying such other replica sites, an update notification including contents of a metadata descriptor may be sent to the other replica sites in one or more additional replication stages.
    • 具有轻松一致性的容错多级数据复制的系统包括耦合到处理器的一个或多个处理器和存储器,其中存储器存储可由处理器执行的程序指令以实现数据复制服务。 响应于针对数据对象的更新请求,在第一复制阶段中,数据复制服务被配置为更新数据对象的多个主复本站点处的各个主要副本,并且在每个复制站点存储元数据描述符 多个主要副本站点。 配置数据复制服务以确定是否将更新的通知发送到任何其他副本站点。 响应于识别这样的其他复制站点,可以在一个或多个附加复制阶段将包括元数据描述符的内容的更新通知发送到其他副本站点。
    • 9. 发明授权
    • Method and system for providing deduplication information to applications
    • 向应用程序提供重复数据删除信息的方法和系统
    • US08392437B2
    • 2013-03-05
    • US12724222
    • 2010-03-15
    • Anirban MukherjeeAnindya Banerjee
    • Anirban MukherjeeAnindya Banerjee
    • G06F7/00G06F17/30
    • 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.
    • 维护和提供与文件重复数据删除相关的信息的方法。 识别包含第一内容的第一文件的第一部分和第二文件的第二部分。 创建与第一部分相关联的第一标题。 第一标题标识包含第一内容的第一部分和第二部分。 第一标题被附加到第一部分的第一内容的存储位置,以形成第一文件的第一数据结构。 存储第一个数据结构。 将第一数据结构提供给请求第一文件的应用程序,以便应用可以避免重复的数据处理。 当第一个文件或第二个文件被更改时,第一个数据结构被更新。 可能会发生类似的过程来生成第二个文件的数据结构。
    • 10. 发明申请
    • USING A PER FILE ACTIVITY RATIO TO OPTIMALLY RELOCATE DATA BETWEEN VOLUMES
    • 使用每个文件活动比例来最佳地相互调整数据之间的数据
    • US20110106863A1
    • 2011-05-05
    • US12610175
    • 2009-10-30
    • Murthy V. MamidiKadir OzdemirCharles SilversPaul MassigliaAnindya BanerjeeRonald Karr
    • Murthy V. MamidiKadir OzdemirCharles SilversPaul MassigliaAnindya BanerjeeRonald Karr
    • G06F17/30
    • G06F17/30221G06F3/0649
    • A method for identifying data for relocation in a multivolume file system. The method includes generating a file location map, the file location map containing a list of the locations of files that occupy space on each of a plurality of volumes of the file system, wherein The file system comprising least a first volume and a second volume. The method further includes updating the file location map in accordance with changes in a file change log for the file system, and identifying data residing on the first volume of the file system by scanning the file location map. Using the identified data, a ratio of per-file activity during a first time period relative to overall file system activity over a second time period is calculated to derive a file activity ratio for each of the files of the identified data. Files are then selected for relocation based on the file activity ratio.
    • 一种识别多卷文件系统中重定位数据的方法。 所述方法包括生成文件位置图,所述文件位置图包含在所述文件系统的多个卷中的每一个上占据空间的文件的位置的列表,其中所述文件系统包括至少第一卷和第二卷。 该方法还包括根据文件系统的文件更改日志的更改来更新文件位置图,以及通过扫描文件位置图来识别驻留在文件系统的第一卷上的数据。 使用所识别的数据,计算在第一时间段内相对于第二时间段内的整体文件系统活动的每文件活动的比率,以导出所识别的数据的每个文件的文件活动比率。 然后根据文件活动率选择文件进行重定位。