会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Dynamic component placement in an event-driven component-oriented network data processing system
    • 动态组件放置在事件驱动的面向组件的网络数据处理系统中
    • US07962650B2
    • 2011-06-14
    • US12100915
    • 2008-04-10
    • Geetika Tewari LakshmananChitra DoraiRobert Evan Strom
    • Geetika Tewari LakshmananChitra DoraiRobert Evan Strom
    • G06F15/173
    • H04L45/22H04L45/02H04L45/08H04L45/122
    • Method, system and computer usable program code for dynamic component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing computational components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer. Using the routing values in a context of the change, a performance cost of the system is estimated based on hypothetical changed placements of the computational components at nodes along paths from a producer to a consumer through the next-hop neighbor nodes for each consumer, and a changed placement of the computational components that minimizes performance cost of the system relative to the hypothetical changed placements is selected.
    • 在具有生产者,消费者,生产者和消费者之间的多个节点的事件处理系统中的动态组件放置的方法,系统和计算机可用程序代码以及表示在生产者和消费者之间执行的计算组件的流程图。 接收到对系统更改的描述。 在每个节点处,识别每个消费者的下一跳邻居节点。 路由值被分配给每个消费者的每个下一跳邻居节点。 在变化的上下文中使用路由值,系统的性能成本基于通过每个消费者的下一跳邻居节点沿着从生产者到消费者的路径的节点处的计算组件的假想改变的布局来估计,以及 选择最小化系统的性能成本相对于假设的改变的位置的计算组件的改变的位置。
    • 2. 发明申请
    • Dynamic Component Placement in an Event-Driven Component-Oriented Network Data Processing System
    • 在事件驱动的面向组件的网络数据处理系统中的动态组件放置
    • US20090259769A1
    • 2009-10-15
    • US12100915
    • 2008-04-10
    • Geetika Tewari LakshmananChitra DoraiRobert Evan Strom
    • Geetika Tewari LakshmananChitra DoraiRobert Evan Strom
    • G06F15/16
    • H04L45/22H04L45/02H04L45/08H04L45/122
    • Method, system and computer usable program code for dynamic component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing computational components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer. Using the routing values in a context of the change, a performance cost of the system is estimated based on hypothetical changed placements of the computational components at nodes along paths from a producer to a consumer through the next-hop neighbor nodes for each consumer, and a changed placement of the computational components that minimizes performance cost of the system relative to the hypothetical changed placements is selected.
    • 在具有生产者,消费者,生产者和消费者之间的多个节点的事件处理系统中的动态组件放置的方法,系统和计算机可用程序代码以及表示在生产者和消费者之间执行的计算组件的流程图。 接收到对系统更改的描述。 在每个节点处,识别每个消费者的下一跳邻居节点。 路由值被分配给每个消费者的每个下一跳邻居节点。 在变化的上下文中使用路由值,系统的性能成本基于通过每个消费者的下一跳邻居节点沿着从生产者到消费者的路径的节点处的计算组件的假设改变的布置来估计,以及 选择最小化系统的性能成本相对于假设的改变的位置的计算组件的改变的位置。
    • 3. 发明授权
    • Stochastic control optimization for sender-based flow control in a distributed stateful messaging system
    • 在分布式状态消息系统中基于发件人的流控制的随机控制优化
    • US07761401B2
    • 2010-07-20
    • US11759639
    • 2007-06-07
    • Chitra DoraiJeong-Hyon HwangRobert Evan Strom
    • Chitra DoraiJeong-Hyon HwangRobert Evan Strom
    • G06F15/18
    • H04L67/325
    • A method and system for controlling message flow in distributed stream processing. State transition probabilities in a Markov model having one state per staleness value of data are determined for sending or withholding updates of data to subscribers using expected message rates from an information provider. A cost function annotates each state transition in the model with a state transition cost for each decision to “send” or “withhold”. A propagation policy specifying whether to send or withhold the message is determined for each state. The propagation policy is then deployed. If a new message comprising an update of data is received during a lapsed time unit, a staleness value of the data held by subscribers is increased. The propagation policy is used to determine whether to send or withhold the message. If the message should be sent, the message is propagated and the staleness value of the data is reset.
    • 一种用于控制分布式流处理中的消息流的方法和系统。 确定具有每个数据的每个数据值的一个状态的马尔科夫模型中的状态转移概率,用于使用来自信息提供者的预期消息速率向用户发送或拒绝更新数据。 成本函数用模型中的每个状态转换来注释每个决定“发送”或“扣留”的状态转移成本。 确定是否为每个状态确定发送或保留消息的传播策略。 然后部署传播策略。 如果在经过的时间单位期间接收到包括数据更新的新消息,则增加了由订户保持的数据的陈旧值。 传播策略用于确定是发送还是保留消息。 如果要发送消息,则传播消息并重置数据的陈旧值。
    • 5. 发明授权
    • Optimizing migration policy during live virtual memory migration
    • 在实时虚拟内存迁移期间优化迁移策略
    • US08386612B2
    • 2013-02-26
    • US12368542
    • 2009-02-10
    • Chitra DoraiRobert Evan StromSai Zeng
    • Chitra DoraiRobert Evan StromSai Zeng
    • G06F15/173G06F9/455
    • G06F9/4856G06F2009/4557
    • Controlling live migration of a running application between a source machine and a target machine is provided. At least one application characteristic and at least one network characteristic are obtained. An objective function that defines a cost to migrate from the source machine to the target machine as a function such as a weighted combination of at least one cost property is obtained. The objective function is optimized using the at least one application characteristic and the at least one network characteristic to determine a policy specifying when to switch execution of the running application from the source machine to the target machine. Live migration of the application from the source machine is controlled to send pages from the source machine to the target machine in accordance with the policy, and to switch the execution of the application from the source machine to the target machine at a state specified by the policy.
    • 提供了在源计算机和目标机器之间控制正在运行的应用程序的实时迁移。 获得至少一个应用特征和至少一个网络特性。 获得了定义从源计算机迁移到目标机器的成本作为诸如至少一个成本属性的加权组合的函数的目标函数。 使用至少一个应用特征和至少一个网络特性优化目标函数,以确定指定何时将运行的应用程序的运行从源机器切换到目标机器的策略。 控制应用程序从源计算机的实时迁移,以根据策略将源从源计算机发送到目标计算机,并将应用程序的执行从源计算机切换到目标计算机,其状态由 政策。
    • 7. 发明申请
    • STOCHASTIC CONTROL OPTIMIZATION FOR SENDER-BASED FLOW CONTROL IN A DISTRIBUTED STATEFUL MESSAGING SYSTEM
    • 分布式状态消息传递系统中基于发送者的流量控制的机器人控制优化
    • US20080306888A1
    • 2008-12-11
    • US11759639
    • 2007-06-07
    • Chitra DoraiJeong-Hyon HwangRobert Evan Strom
    • Chitra DoraiJeong-Hyon HwangRobert Evan Strom
    • G06F15/18G06F17/00
    • H04L67/325
    • A method and system for controlling message flow in distributed stream processing. State transition probabilities in a Markov model having one state per staleness value of data are determined for sending or withholding updates of data to subscribers using expected message rates from an information provider. A cost function annotates each state transition in the model with a state transition cost for each decision to “send” or “withhold”. A propagation policy specifying whether to send or withhold the message is determined for each state. The propagation policy is then deployed. If a new message comprising an update of data is received during a lapsed time unit, a staleness value of the data held by subscribers is increased. The propagation policy is used to determine whether to send or withhold the message. If the message should be sent, the message is propagated and the staleness value of the data is reset.
    • 一种用于控制分布式流处理中的消息流的方法和系统。 确定具有每个数据的每个数据值的一个状态的马尔科夫模型中的状态转移概率,用于使用来自信息提供者的预期消息速率向用户发送或拒绝更新数据。 成本函数用模型中的每个状态转换来注释每个决定“发送”或“扣留”的状态转移成本。 确定是否为每个状态确定发送或保留消息的传播策略。 然后部署传播策略。 如果在经过的时间单位期间接收到包括数据更新的新消息,则增加了由订户保持的数据的陈旧值。 传播策略用于确定是发送还是保留消息。 如果要发送消息,则传播消息并重置数据的陈旧值。
    • 8. 发明申请
    • Optimizing Migration Policy During Live Virtual Memory Migration
    • 在实时虚拟内存迁移期间优化迁移策略
    • US20100205252A1
    • 2010-08-12
    • US12368542
    • 2009-02-10
    • Chitra DoraiRobert Evan StromSai Zeng
    • Chitra DoraiRobert Evan StromSai Zeng
    • G06F15/16
    • G06F9/4856G06F2009/4557
    • A mechanism for controlling live migration of a running application between a source machine and a target machine. At least one application characteristic and at least one network characteristic are obtained. An objective function that defines a cost to migrate from the source machine to the target machine as a function such as a weighted combination of at least one cost property is obtained. The objective function is optimized using the at least one application characteristic and the at least one network characteristic to determine a policy specifying when to switch execution of the running application from the source machine to the target machine. Live migration of the application from the source machine is controlled to send pages from the source machine to the target machine in accordance with the policy, and to switch the execution of the application from the source machine to the target machine at a state specified by the policy.
    • 用于控制源计算机和目标计算机之间正在运行的应用程序的实时迁移的机制。 获得至少一个应用特征和至少一个网络特性。 获得了定义从源计算机迁移到目标机器的成本作为诸如至少一个成本属性的加权组合的函数的目标函数。 使用至少一个应用特征和至少一个网络特性优化目标函数,以确定指定何时将运行的应用程序的运行从源机器切换到目标机器的策略。 控制应用程序从源计算机的实时迁移,以根据策略将源从源计算机发送到目标计算机,并将应用程序的执行从源计算机切换到目标计算机,其状态由 政策。
    • 9. 发明申请
    • TRANSACTIONAL QUALITY OF SERVICE IN EVENT STREAM PROCESSING MIDDLEWARE
    • 活动流程中间件的交易质量
    • US20100042999A1
    • 2010-02-18
    • US12192876
    • 2008-08-15
    • Chitra DoraiRobert Evan Strom
    • Chitra DoraiRobert Evan Strom
    • G06F9/46
    • G06F9/466
    • Computer implemented method, system and computer usable program code for achieving transactional quality of service in a transactional object store system. A transaction is received from a client and is executed, wherein the transaction comprises reading a read-only derived object, or reading or writing another object, and ends with a decision to request committing the transaction or a decision to request aborting the transaction. Responsive to a decision to request committing the transaction, wherein the transaction comprises writing a publishing object, events are delivered to event stream processing queries, and are executed in parallel with executing of the transaction. Responsive to a decision to request committing a transaction that comprises reading a read-only derived object, a validation is performed to determine whether the transaction can proceed to be committed, whether the transaction should abort, or whether the validation should delay waiting for one or more event stream processing queries to complete.
    • 计算机实现的方法,系统和计算机可用程序代码,用于在事务对象存储系统中实现事务性服务质量。 从客户端接收到一个事务并被执行,其中该事务包括读取只读派生对象,或者读取或写入另一个对象,并且以决定请求提交交易或决定请求中止该事务结束。 响应于要求提交交易的决定,其中所述交易包括写出发布对象,事件被传递到事件流处理查询,并且与所述事务的执行并行执行。 响应于要求提交包括读取只读派生对象的事务的决定,执行验证以确定事务是否可以继续提交,事务是否应该中止,还是验证是否应该延迟等待一个或 更多事件流处理查询完成。
    • 10. 发明授权
    • System and method for time-aware run-time to guarantee time
    • 用于时间识别运行时的系统和方法来保证时间
    • US08424005B2
    • 2013-04-16
    • US12509962
    • 2009-07-27
    • Robert E. StromChitra DoraiHuining FengWei Zheng
    • Robert E. StromChitra DoraiHuining FengWei Zheng
    • G06F9/46G06F13/00
    • G06F11/1482G06F9/546G06F2209/547
    • A method and system for achieving time-awareness in the highly available, fault-tolerant execution of components in a distributed computing system, without requiring the writer of these components to explicitly write code (such as entity beans or database transactions) to make component state persistent. It is achieved by converting the intrinsically non-deterministic behavior of the distributed system to a deterministic behavior, thus enabling state recovery to be achieved by advantageously efficient checkpoint-replay techniques. The system is deterministic by repeating the execution of the receiving component by processing the messages in the same order as their associated timestamps and time-aware by allowing adjustment of message execution based on time.
    • 一种方法和系统,用于在分布式计算系统中高度可用的容错执行组件中实现时间感知,而不需要这些组件的写入程序来明确地编写代码(如实体bean或数据库事务)以使组件状态 持久的 通过将分布式系统的本质非确定性行为转换为确定性行为来实现,从而通过有利的高效检查点重放技术实现状态恢复。 该系统通过以与其关联的时间戳相同的顺序处理消息并且通过基于时间允许调整消息执行的时间感知来重复执行接收组件来确定性。