PLACEMENT OF GRAPH-BASED WORKLOAD TASKS WITH OPTIMAL INFRASTRUCTURE SELECTION AND LINK STATE ASSESSMENTS

原文（中文）

One example method includes maintaining a database of past executions of graph-based workloads and respective infrastructure graphs where the graph-based workloads were executed, obtaining a graph embedding of a new graph-based workload and searching for similar graph-based workloads in the database, retrieving each similar graph-based workload from the database, where each of the similar graph-based workloads is associated with a respective infrastructure subgraph corresponding to where that similar graph-based workload was executed, searching a large graph-based infrastructure topology for infrastructure subgraphs that are similar to the infrastructure subgraphs retrieved from the database, and retrieving a group of infrastructure subgraphs that collectively define a set of candidate nodes to run the new graph-based workload, filtering and ranking the set of candidate nodes according to a respective likelihood that the candidate nodes will satisfy requirements of the new graph-based workload, and assigning the new graph-based workload to one of the candidate nodes.