会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Methods and systems for deploying a service workflow in a hybrid cloud environment
    • 在混合云环境中部署服务工作流的方法和系统
    • US08463633B2
    • 2013-06-11
    • US13192221
    • 2011-07-27
    • Gueyoung JungHua LiuRamses V. Morales
    • Gueyoung JungHua LiuRamses V. Morales
    • G06Q40/00
    • G06Q10/06G06Q10/103
    • A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.
    • 接收到包含有序服务的服务工作流,并为每个服务计算启发式效用值。 选择具有用于服务的最小启发式效用值的最佳节点,并且将最佳节点标识符放置在节点列表中。 如果最佳节点包括并行子工作流程,则可以通过从数据中心生成潜在的下一个节点来识别潜在的下一个节点,数据中心可以以最小的运行时间值执行与最佳节点相关联的服务。 否则,基于与服务相关联的数据中心生成潜在的下一个节点。 为每个潜在的下一个节点确定启发式效用值,并根据启发式实用值选择一个新的最佳节点。 重复识别,确定和选择操作,直到最佳节点仅包含最后有序服务。 基于最佳节点识别每个有序服务的数据中心。
    • 10. 发明授权
    • Systems and methods of partitioning data for synchronous parallel processing
    • 用于同步并行处理的数据分区系统和方法
    • US08429165B1
    • 2013-04-23
    • US13413978
    • 2012-03-07
    • Gueyoung JungShanmuga-Nathan GnanasambandamTridib Mukherjee
    • Gueyoung JungShanmuga-Nathan GnanasambandamTridib Mukherjee
    • G06F17/30
    • G06F9/505G06F17/3089
    • Methods and systems for partitioning data for processing in a plurality of data centers are disclosed. For each of a plurality of data centers, a time period required for the data center to process an amount of information may be estimated. The plurality of data centers may be ordered based on the time period for each data center. Data may be received from one or more sources. A data center having a smallest time period from the ordered plurality of data centers may be selected to be added to a set of data centers. An overall execution time for the set of data centers to process the data may be determined. The selecting and determining operations may be repeated until the overall execution time satisfies one or more threshold criteria. The data may be transmitted to the set of data centers.
    • 公开了用于分割用于在多个数据中心中进行处理的数据的方法和系统。 对于多个数据中心中的每一个,可以估计数据中心处理信息量所需的时间段。 可以基于每个数据中心的时间段来排序多个数据中心。 可以从一个或多个来源接收数据。 可以选择具有来自有序多个数据中心的最小时间周期的数据中心以被添加到一组数据中心。 可以确定用于处理数据的数据中心集合的总执行时间。 可以重复选择和确定操作,直到总体执行时间满足一个或多个阈值标准。 数据可以被发送到数据中心集合。