公开(公告)号：US20130226670A1

公开(公告)日：2013-08-29

申请号：US13403440

申请日：2012-02-23

申请人： Andres Quiroz Hernandez ,  Ramses V. Morales ,  Hua Liu

发明人： Andres Quiroz Hernandez ,  Ramses V. Morales ,  Hua Liu

IPC分类号： G06Q10/06

CPC分类号： G06Q10/06 ,  G06Q10/067

摘要： A method of implementing a business process may include receiving business process information associated with a business process. The business process information may include a graph representing one or more activities to be performed to complete the business process. The method may include identifying, by a computing device, a number of groups associated with the business process information. Each group may be capable of performing at least a portion of the activities. The method may include partitioning, by the computing device, the graph into a number of fragments that is greater than or equal to the number of identified groups. Each fragment may include one or more activities from the graph. The method may include, for each fragment, transmitting the fragment to an identified group that is capable of performing each activity associated with the fragment, and orchestrating the performance of the activities associated with each fragment by each group.

摘要翻译： 实现业务流程的方法可以包括接收与业务流程相关联的业务流程信息。 业务流程信息可以包括表示要完成业务流程的一个或多个活动的图表。 该方法可以包括由计算设备识别与业务过程信息相关联的组的数量。 每组可能能够执行至少一部分活动。 该方法可以包括由计算设备将该图划分成大于或等于所识别的组的数目的多个片段。 每个片段可以包括图中的一个或多个活动。 对于每个片段，该方法可以包括将片段发送到能够执行与片段相关联的每个活动的标识组，并且协调每个组与每个片段相关联的活动的性能。

公开(公告)号：US08463633B2

公开(公告)日：2013-06-11

申请号：US13192221

申请日：2011-07-27

申请人： Gueyoung Jung ,  Hua Liu ,  Ramses V. Morales

发明人： Gueyoung Jung ,  Hua Liu ,  Ramses V. Morales

IPC分类号： G06Q40/00

CPC分类号： G06Q10/06 ,  G06Q10/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.

摘要翻译： 接收到包含有序服务的服务工作流，并为每个服务计算启发式效用值。 选择具有用于服务的最小启发式效用值的最佳节点，并且将最佳节点标识符放置在节点列表中。 如果最佳节点包括并行子工作流程，则可以通过从数据中心生成潜在的下一个节点来识别潜在的下一个节点，数据中心可以以最小的运行时间值执行与最佳节点相关联的服务。 否则，基于与服务相关联的数据中心生成潜在的下一个节点。 为每个潜在的下一个节点确定启发式效用值，并根据启发式实用值选择一个新的最佳节点。 重复识别，确定和选择操作，直到最佳节点仅包含最后有序服务。 基于最佳节点识别每个有序服务的数据中心。