会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Message queuing with flexible consistency options
    • 消息排队具有灵活的一致性选项
    • US08627333B2
    • 2014-01-07
    • US13197461
    • 2011-08-03
    • Han ChenMinkyong KimHui LeiFan Ye
    • Han ChenMinkyong KimHui LeiFan Ye
    • G06F3/00
    • G06F9/546G06F2209/548
    • Embodiments of the invention relate to message queuing. In one embodiment, a request from an application for retrieving a message from a queue is received. The queue is stored across multiple nodes of a distributed storage system. A preference with respect to message order and message duplication associated with the queue is identified. A message sequence index associated with the queue is sampled based on the preference that has been identified. The message is selected in response to the sampling. The message that has been selected is made unavailable to other applications for a given interval of time, while maintaining the message in the queue. The message is sent to the application.
    • 本发明的实施例涉及消息队列。 在一个实施例中,接收来自应用程序的来自队列检索消息的请求。 队列存储在分布式存储系统的多个节点上。 识别与队列相关联的消息顺序和消息复制的偏好。 基于已经识别的偏好,对与队列相关联的消息序列索引进行采样。 选择该消息以响应采样。 已经选择的消息在给定的时间间隔内对其他应用程序不可用,同时将消息保留在队列中。 该消息被发送到应用程序。
    • 6. 发明授权
    • Method and system for federated resource discovery service in distributed systems
    • 分布式系统中联合资源发现服务的方法和系统
    • US07849069B2
    • 2010-12-07
    • US11471981
    • 2006-06-21
    • Zhen LiuHao YangFan Ye
    • Zhen LiuHao YangFan Ye
    • G06F17/30
    • G06F17/30545
    • Resources disposed within a plurality of distributed and autonomous computing systems, each of which may have its own legacy resource discovery service, are identified and allocated. Resource identification servers disposed within each one of the distributed computing systems communicate resource attribute data to a tree hierarchy of dedicated servers. The resource attribute data are maintained in native formats within the distributed computing systems and are mapped to a common format provided by the dedicated servers. The resource attribute data are aggregated at each node within the tree hierarchy, communicated up through the tree hierarchy to one or more root nodes and replicated down through all of the nodes. Additional system robustness is provided through period resource checks and resource attribute data updates. Resource allocation queries are submitted to any level node within the hierarchy and forwarded to the proper computing system for processing.
    • 分配在多个分布式和自主的计算系统中的资源,每个计算系统中的每一个可以具有其自己的传统资源发现服务。 布置在每个分布式计算系统内的资源识别服务器将资源属性数据传送到专用服务器的树层。 资源属性数据以分布式计算系统内的本机格式进行维护,并映射到由专用服务器提供的通用格式。 资源属性数据在树层次结构中的每个节点进行聚合,通过树层次结构传递到一个或多个根节点,并通过所有节点进行复制。 通过周期资源检查和资源属性数据更新来提供额外的系统稳健性。 资源分配查询被提交到层次结构中的任何级节点,并转发到正确的计算系统进行处理。
    • 7. 发明申请
    • Method for Inter-Site Data Stream Transfer in a Cooperative Data Stream Processing
    • 在协同数据流处理中的站点间数据流传输方法
    • US20080256166A1
    • 2008-10-16
    • US11747694
    • 2007-05-11
    • Michael J. BransonFrederick DouglisZhen LiuFan Ye
    • Michael J. BransonFrederick DouglisZhen LiuFan Ye
    • G06F15/16
    • H04L12/4633H04L69/40
    • A cooperative data stream processing system is provided that utilizes a plurality of independent, autonomous and potentially heterogeneous sites in a cooperative arrangement to process user-defined inquiries over dynamic, continuous streams of data. The system derives jobs from the inquiries and these jobs are executed on the various distributed sites by executing applications containing processing elements on these sites. Therefore, components of a given job can be executed simultaneously and in parallel on a plurality of sites within in the system. The sites associated with a given job execution have the need to share data, both primal and derived. A tunnel mechanism is provided that establishes tunnels between pairs of sites within the system. Each tunnel includes either a sink processing element on an originating site and a source processing element on a destination site or a gateway processing element on each site and a network connection between the sink and source processing elements. The sink and source processing elements are in communication with application processing elements on their respective sites and facilitate the exchange of data between these application processing elements. Tunnels can be establish on demand or in accordance with a prescribed plan and can be job specific of generic to any job executing on a given pair of sites.
    • 提供协作数据流处理系统,其利用协作布置中的多个独立的,自主的和潜在的异构站点来处理关于动态的,连续的数据流的用户定义的查询。 系统从查询中导出作业,这些作业通过执行包含这些站点上的处理元素的应用程序在各种分布式站点上执行。 因此,给定作业的组件可以在系统内的多个站点上同时并行地执行。 与给定作业执行相关联的站点需要共享数据,包括原始数据和派生数据。 提供了一种在系统内的站点对之间建立隧道的隧道机制。 每个隧道包括发起站点上的宿处理元件和目的站点上的源处理元件或每个站点上的网关处理元件以及宿和源处理元件之间的网络连接。 宿和源处理元件与其各自站点上的应用处理元件通信,并且便于这些应用处理元件之间的数据交换。 隧道可以根据需要或按照规定的计划建立,并且可以对于在给定的一对站点上执行的任何作业具有通用性。
    • 9. 发明授权
    • Method for inter-site data stream transfer in cooperative data stream processing
    • 协同数据流处理中的站间数据流传输方法
    • US08688850B2
    • 2014-04-01
    • US11747694
    • 2007-05-11
    • Michael J. BransonFrederick DouglisZhen LiuFan Ye
    • Michael J. BransonFrederick DouglisZhen LiuFan Ye
    • G06F17/30
    • H04L12/4633H04L69/40
    • A cooperative data stream processing system is provided that utilizes a plurality of independent, autonomous and potentially heterogeneous sites in a cooperative arrangement to process user-defined inquiries over dynamic, continuous streams of data. The system derives jobs from the inquiries and these jobs are executed on the various distributed sites by executing applications containing processing elements on these sites. Therefore, components of a given job can be executed simultaneously and in parallel on a plurality of sites within in the system. The sites associated with a given job execution have the need to share data, both primal and derived. A tunnel mechanism is provided that establishes tunnels between pairs of sites within the system. Each tunnel includes either a sink processing element on an originating site and a source processing element on a destination site or a gateway processing element on each site and a network connection between the sink and source processing elements. The sink and source processing elements are in communication with application processing elements on their respective sites and facilitate the exchange of data between these application processing elements. Tunnels can be establish on demand or in accordance with a prescribed plan and can be job specific of generic to any job executing on a given pair of sites.
    • 提供协作数据流处理系统,其利用协作布置中的多个独立的,自主的和潜在的异构站点来处理关于动态的,连续的数据流的用户定义的查询。 系统从查询中导出作业,这些作业通过执行包含这些站点上的处理元素的应用程序在各种分布式站点上执行。 因此,给定作业的组件可以在系统内的多个站点上同时并行地执行。 与给定作业执行相关联的站点需要共享数据,包括原始数据和派生数据。 提供了一种在系统内的站点对之间建立隧道的隧道机制。 每个隧道包括发起站点上的宿处理元件和目的站点上的源处理元件或每个站点上的网关处理元件以及宿和源处理元件之间的网络连接。 宿和源处理元件与其各自站点上的应用处理元件通信,并且便于这些应用处理元件之间的数据交换。 隧道可以根据需要或按照规定的计划建立,并且可以对于在给定的一对站点上执行的任何作业具有通用性。
    • 10. 发明授权
    • System and apparatus for optimally trading off the replication overhead and consistency level in distributed applications
    • 用于最佳地折中分布式应用程序中的复制开销和一致性级别的系统和设备
    • US07506011B2
    • 2009-03-17
    • US11493373
    • 2006-07-26
    • Zhen LiuHonghui XiaHao YangFan Ye
    • Zhen LiuHonghui XiaHao YangFan Ye
    • G06F17/30
    • G06F17/30578Y10S707/99932Y10S707/99953Y10S707/99955
    • Methods and systems are provided for optimally trading off replication overhead and consistency levels in distributed data replication where nodes are organized in a hierarchy. The root node has the original data that need to be replicated at all other nodes, and the replicated copies have a freshness threshold that must be satisfied. The data are propagated through periodic updates in the hierarchy. Each node periodically sends data to its child nodes. Given the freshness threshold, an algorithm and its distributed protocol can determine the optimal update period for each link of the hierarchy such that the freshness threshold is satisfied for every node and the overall replication overhead is minimized. The systems and methods can be used in any scenario where replicated data have consistency requirements, such as in a replicate overlay assisted resource discovery system.
    • 提供了方法和系统,用于最佳地折中分布式数据复制中的复制开销和一致性级别,其中节点被组织在层次结构中。 根节点具有需要在所有其他节点进行复制的原始数据,并且复制副本具有必须满足的新鲜度阈值。 数据通过层次结构中的定期更新进行传播。 每个节点周期性地向其子节点发送数据。 给定新鲜度阈值,算法及其分布式协议可以确定层次结构的每个链路的最佳更新周期,使得每个节点满足新鲜度阈值,并将整体复制开销最小化。 系统和方法可以在复制数据具有一致性要求的任何情况下使用,例如在复制覆盖辅助资源发现系统中。