会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Negotiation management in data processing systems
    • 数据处理系统中的谈判管理
    • US08656403B2
    • 2014-02-18
    • US12112142
    • 2008-04-30
    • Bo AnFrederick DouglisBradley William FawcettAnton V. RiabovFan Ye
    • Bo AnFrederick DouglisBradley William FawcettAnton V. RiabovFan Ye
    • G06F9/46
    • G06F9/5038G06F2209/5014G06F2209/506
    • Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated. In accordance with the optimized resource negotiation schedule, a request for each needed resource is sent to the one or more potential resource providers such that a negotiation process is performed between the negotiation management component and at least one of the potential resource providers.
    • 公开了用于优化用于在数据处理系统中执行任务的计划中使用的计划的技术。 例如,在数据处理系统中协商资源的自动化方法,其中所述数据处理系统包括多个站点,包括在执行以下步骤的给定一个站点处的计算机系统的协商管理组件。 获得来自一个或多个计划的至少一个来源的一个或多个任务。 每个计划在数据处理系统中的一个或多个站点上用一个或多个所需资源和一个或多个潜在资源提供者进行注释。 计算基于一个或多个获得的任务的优化的资源协商调度。 时间表包括协商资源的顺序。 根据优化的资源协商进度,向所述一个或多个潜在资源提供者发送对每个所需资源的请求,使得在协商管理组件和潜在资源提供者中的至少一个之间执行协商过程。
    • 12. 发明授权
    • Mechanism for execution of multi-site jobs in a data stream processing system
    • 在数据流处理系统中执行多站点作业的机制
    • US08417762B2
    • 2013-04-09
    • US11747813
    • 2007-05-11
    • Michael J. BransonFrederick DouglisFan Ye
    • Michael J. BransonFrederick DouglisFan Ye
    • G06F15/16G06F15/00
    • G06F11/203G06F9/5027G06F11/1438G06F11/1446G06F2209/5017G06F2209/508H04L69/40
    • A cooperative data stream processing system utilizing a plurality of independent, autonomous and heterogeneous sites in a cooperative arrangement process user-defined job requests over dynamic, continuous streams of data. A distributed plan is created that identifies the processing elements that constitute a job that is derived from user-defined inquiries. These processing elements are arranged into subjobs that are mapped to various sites within the system for execution. The jobs are executed across the plurality of distributed sites in accordance with the distributed plan. The distributed plan also includes requirements for monitoring and back-up of the execution sites in the event of a failure on one of those sites. Execution of the jobs in accordance with the distributed plan is facilitated by the identification of an owner site to which the distributed plan is communicated and which is responsible for driving the execution of the distributed plan.
    • 在协作安排过程中利用多个独立的,自主的和异构的站点的协作数据流处理系统用户定义的作业通过动态的,连续的数据流请求。 创建一个分布式计划,标识构成从用户定义的查询导出的作业的处理元素。 这些处理元件被布置成被映射到系统内的各个站点以执行的子对象。 根据分布式计划,这些作业在多个分布式站点之间执行。 分布式计划还包括在其中一个站点发生故障时监视和备份执行站点的要求。 通过识别分配的计划被传达的所有者站点以及负责驱动分布式计划的执行来促进按照分布式计划执行作业。
    • 13. 发明授权
    • Mechanism for recovery from site failure in a stream processing system
    • 在流处理系统中从站点故障恢复的机制
    • US08219848B2
    • 2012-07-10
    • US11733724
    • 2007-04-10
    • Michael John BransonFrederick DouglisBradley William FawcettZhen LiuBin RongFan Ye
    • Michael John BransonFrederick DouglisBradley William FawcettZhen LiuBin RongFan Ye
    • G06F11/00
    • G06F11/2025G06F11/2048G06F11/2097
    • A failure recovery framework to be used in cooperative data stream processing is provided that can be used in a large-scale stream data analysis environment. Failure recovery supports a plurality of independent distributed sites, each having its own local administration and goals. The distributed sites cooperate in an inter-site back-up mechanism to provide for system recovery from a variety of failures within the system. Failure recovery is both automatic and timely through cooperation among sites. Back-up sites associated with a given primary site are identified. These sites are used to identify failures within the primary site including failures of applications running on the nodes of the primary site. The failed applications are reinstated on one or more nodes within the back-up sites using job management instances local to the back-up sites in combination with previously stored state information and data values for the failed applications. In additions to inter-site mechanisms, each one of the plurality of sites employs an intra-site back-up mechanism to handle failure recoveries within the site.
    • 提供了可用于协作数据流处理的故障恢复框架,可用于大规模流数据分析环境。 故障恢复支持多个独立的分布式站点,每个都有自己的本地管理和目标。 分布式站点在站点间备份机制中进行协作,以便从系统内的各种故障提供系统恢复。 故障恢复是通过站点之间的合作自动和及时的。 识别与给定主要站点相关联的备用站点。 这些站点用于识别主站点中的故障,包括在主站点的节点上运行的应用程序的故障。 使用备份站点本地的作业管理实例以及先前存储的状态信息和失败应用程序的数据值,在备份站点中的一个或多个节点上恢复失败的应用程序。 除了站点间机制之外,多个站点中的每一个都采用站内备用机制来处理站点内的故障恢复。
    • 15. 发明授权
    • 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.
    • 本发明的实施例涉及消息队列。 在一个实施例中,接收来自应用程序的来自队列检索消息的请求。 队列存储在分布式存储系统的多个节点上。 识别与队列相关联的消息顺序和消息复制的偏好。 基于已经识别的偏好,对与队列相关联的消息序列索引进行采样。 选择该消息以响应采样。 已经选择的消息在给定的时间间隔内对其他应用程序不可用,同时将消息保留在队列中。 该消息被发送到应用程序。
    • 18. 发明授权
    • 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.
    • 分配在多个分布式和自主的计算系统中的资源,每个计算系统中的每一个可以具有其自己的传统资源发现服务。 布置在每个分布式计算系统内的资源识别服务器将资源属性数据传送到专用服务器的树层。 资源属性数据以分布式计算系统内的本机格式进行维护,并映射到由专用服务器提供的通用格式。 资源属性数据在树层次结构中的每个节点进行聚合,通过树层次结构传递到一个或多个根节点,并通过所有节点进行复制。 通过周期资源检查和资源属性数据更新来提供额外的系统稳健性。 资源分配查询被提交到层次结构中的任何级节点,并转发到正确的计算系统进行处理。
    • 20. 发明授权
    • 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.
    • 提供了方法和系统,用于最佳地折中分布式数据复制中的复制开销和一致性级别,其中节点被组织在层次结构中。 根节点具有需要在所有其他节点进行复制的原始数据,并且复制副本具有必须满足的新鲜度阈值。 数据通过层次结构中的定期更新进行传播。 每个节点周期性地向其子节点发送数据。 给定新鲜度阈值,算法及其分布式协议可以确定层次结构的每个链路的最佳更新周期,使得每个节点满足新鲜度阈值,并将整体复制开销最小化。 系统和方法可以在复制数据具有一致性要求的任何情况下使用,例如在复制覆盖辅助资源发现系统中。