Service Scheduling Method, Apparatus, and System

摘要

A service scheduling method, applied to a stream computing system, is presented. The stream computing system includes a master control node and multiple working nodes, and the master control node is configured to schedule sub-services included in the service to the multiple working nodes for processing. The method includes acquiring a stream computing application graph of the service; dividing the stream computing application graph according to operator degrees and operator potentials of operators in the stream computing application graph and according to a division quantity for dividing the stream computing application graph, to obtain divided sub-graphs with the division quantity; and scheduling a sub-service corresponding to an operator included in each divided sub-graph to a working node corresponding to the divided sub-graph for processing. The method provided in embodiments of the present disclosure can enable services to use physical resources and network resources in a balanced manner.

主权项

1. A service scheduling method, applied to a stream computing system, wherein the stream computing system is configured to schedule and process a service, wherein the stream computing system comprises a master control node and multiple working nodes, and wherein the master control node is configured to schedule sub-services comprised in the service to the multiple working nodes for processing; the method comprising:
acquiring a stream computing application graph of the service, wherein the stream computing application graph is a logical relationship graph that is created in advance for the service and that comprises operators and moving directions of data streams between the operators, and wherein the operator in the stream computing application graph carries computational logic used for processing a sub-service that is in the service and corresponds to the operator; dividing the stream computing application graph according to operator degrees and operator potentials of the operators in the stream computing application graph and according to a division quantity for dividing the stream computing application graph, to obtain divided sub-graphs with the division quantity, wherein the operator degree is a cumulative sum of traffic weights of input-and-output traffic of the operator, and wherein the operator potential is a load degree of the operator in the stream computing application graph; and scheduling a sub-service corresponding to an operator comprised in each divided sub-graph to a working node corresponding to the divided sub-graph for processing.