会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 86. 发明申请
    • Replaying Distributed Systems
    • 重播分布式系统
    • US20090006064A1
    • 2009-01-01
    • US11771934
    • 2007-06-29
    • Wei LinXuezheng LiuZheng Zhang
    • Wei LinXuezheng LiuZheng Zhang
    • G06G7/62
    • G06F17/5009
    • Replaying distributed systems involves playing a distributed system in a simulator using data from a real-world operation. In an example embodiment, a simulation process is to simulate a distributed system that has a first instance and a second instance. The simulation process includes a first simulation object corresponding to the first instance and a second simulation object corresponding to the second instance. In another example embodiment, communications between the first instance and the second instance are simulated within the simulation process using function calls between the first simulation object and the second simulation object.
    • 重播分布式系统涉及使用来自真实世界操作的数据在模拟器中播放分布式系统。 在示例实施例中,模拟过程是模拟具有第一实例和第二实例的分布式系统。 模拟处理包括对应于第一实例的第一模拟对象和对应于第二实例的第二模拟对象。 在另一个示例实施例中,使用第一仿真对象和第二仿真对象之间的函数调用在模拟过程中模拟第一实例和第二实例之间的通信。
    • 87. 发明授权
    • Data overlay, self-organized metadata overlay, and application level multicasting
    • 数据覆盖,自组织元数据覆盖和应用级多播
    • US07418454B2
    • 2008-08-26
    • US10826674
    • 2004-04-16
    • Yu ChenZheng ZhangXing XieShiding Lin
    • Yu ChenZheng ZhangXing XieShiding Lin
    • G06F17/30G06F7/00
    • H04L67/2804H04L67/2819H04L67/327Y10S707/99942Y10S707/99943
    • A data overlay is built as a data structure on a logical space defined by a distributed hash table (DHT) in a peer-to-peer network. The data overlay includes a tree having tree nodes that each have a zone mapped to a corresponding DHT node in the logical space of the DHT. The logical space of the DHT is mapped to machines, each of which corresponds to one or more of more of the tree node zones. The tree nodes are hierarchically situated by tree node zone size and my available resource so that tasks are performed by machines in the peer-to-peer network according to the respective abilities of the machines to supply the tasks' demand. The tree, which self-organizes and self-heals on the same scale as the underlying DHT, is used together and disseminate information from and to the DHT nodes using the hierarchy of the tree nodes.
    • 在由对等网络中的分布式哈希表(DHT)定义的逻辑空间上构建数据覆盖层作为数据结构。 数据覆盖包括具有树节点的树,每个树节点具有映射到DHT的逻辑空间中的相应DHT节点的区域。 DHT的逻辑空间被映射到机器,每个机器对应于一个或多个更多的树节点区域。 树节点由树节点区域大小和可用资源分层位置,使得任务由对等网络中的机器根据机器提供任务需求的相应能力执行。 与DHT相同的规模自我组织和自我修复的树被一起使用,并使用树节点的层次结构向DHT节点传播信息。
    • 89. 发明授权
    • Cluster storage collection based data management
    • 基于群集存储集合的数据管理
    • US07346734B2
    • 2008-03-18
    • US11137754
    • 2005-05-25
    • Wei ChenQiao LianZheng Zhang
    • Wei ChenQiao LianZheng Zhang
    • G06F12/00G06F11/00
    • G06F17/30215G06F11/1662
    • Cluster storage collection-based data management is described. In one aspect, and in a distributed system for storing data across a network to multiple data storage nodes, a bounded bandwidth available for data repair in the distributed system is determined. A specific number of stripes are then created on each data storage node of the multiple data storage nodes. The stripes are for placement and replication of data objects across respective ones of the data storage nodes. The specific number of stripes created on each data storage node is a function of the determined bounded data repair bandwidth.
    • 描述了基于群集存储收集的数据管理。 在一个方面,并且在用于将网络上的数据存储到多个数据存储节点的分布式系统中,确定了可用于分布式系统中的数据修复的有界带宽。 然后在多个数据存储节点的每个数据存储节点上创建特定数量的条带。 这些条纹用于跨数据存储节点的相应数据对象放置和复制数据对象。 在每个数据存储节点上创建的条带的具体数量是确定的有界数据修复带宽的函数。