CN107526639B - Resource arrangement method, medium, device and computing equipment - Google Patents

Resource arrangement method, medium, device and computing equipment Download PDF

Info

Publication number
CN107526639B
CN107526639B CN201710702299.9A CN201710702299A CN107526639B CN 107526639 B CN107526639 B CN 107526639B CN 201710702299 A CN201710702299 A CN 201710702299A CN 107526639 B CN107526639 B CN 107526639B
Authority
CN
China
Prior art keywords
vertex
resource
resources
updated
directed acyclic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710702299.9A
Other languages
Chinese (zh)
Other versions
CN107526639A (en
Inventor
朱凌墨
冯常健
尧飘海
陈谔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Netease Shuzhifan Technology Co ltd
Original Assignee
Hangzhou Langhe Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Langhe Technology Co Ltd filed Critical Hangzhou Langhe Technology Co Ltd
Priority to CN201710702299.9A priority Critical patent/CN107526639B/en
Publication of CN107526639A publication Critical patent/CN107526639A/en
Application granted granted Critical
Publication of CN107526639B publication Critical patent/CN107526639B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Design And Manufacture Of Integrated Circuits (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the invention provides a resource arrangement method, medium, device and computing equipment. The resource arranging method comprises the following steps: acquiring a description file of resource arrangement; determining the dependency relationship among the resources needing to be arranged based on the description file; and sequentially creating each resource according to the dependency relationship among the resources and the description content aiming at each resource in the description file. The technical scheme provided by the embodiment of the invention can improve the efficiency of arranging the resources and is convenient for managing each resource.

Description

Resource arrangement method, medium, device and computing equipment
Technical Field
The embodiment of the invention relates to the technical field of computers and communication, in particular to a method, a medium, a device and a computing device for arranging resources.
Background
This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
In large-scale distributed application, the demand of internet enterprises on the availability of a system architecture is higher and higher, competition and rapid increase of user demands are faced, and the application is published more and more frequently, so that the period from business development to business online needs to be shortened.
At present, after being basically examined by needs, the service is developed and tested, so that a development environment, a test environment, an integration environment and a pre-release environment need to be provided, corresponding resources need to be arranged for the service to be provided for users, and most application deployment is realized by depending on a manual operation or semi-automatic mode.
Disclosure of Invention
However, since it is necessary to implement the service in a manual or semi-automatic mode, the current service development and resource arrangement are inefficient. In addition, the current resource arranging script only provides resources, and does not describe the relationship between the resources, which not only causes that the developed application may not be started normally, but also is difficult to manage the resources arranged for each service.
For this reason, an improved resource arrangement scheme is highly required to improve the efficiency of resource arrangement and facilitate management of individual resources.
In this context, embodiments of the present invention are intended to provide a method, medium, apparatus and computing device for resource orchestration.
In a first aspect of embodiments of the present invention, there is provided a method for resource orchestration, comprising: acquiring a description file of resource arrangement; determining the dependency relationship among the resources needing to be arranged based on the description file; and sequentially creating each resource according to the dependency relationship among the resources and the description content aiming at each resource in the description file.
In some embodiments of the present invention, based on the foregoing solution, the step of sequentially creating the resources according to the dependency relationships among the resources and the description contents of the description file for the resources includes: abstracting the resources into vertexes; generating directed edges between the vertexes according to the dependency relationship among the resources to obtain a directed acyclic graph describing the dependency relationship among the resources; and sequentially creating each resource according to the directed acyclic graph and the description content of each resource.
In some embodiments of the present invention, based on the foregoing solution, the step of sequentially creating the resources according to the directed acyclic graph and the description content of each resource includes: according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
In some embodiments of the present invention, based on the foregoing scheme, after the respective resources are sequentially created, the method further includes: acquiring a description file after resource arrangement updating; and adjusting each resource needing to be arranged according to the updated description file.
In some embodiments of the present invention, based on the foregoing solution, the step of adjusting each resource to be arranged according to the updated description file includes: generating an updated directed acyclic graph according to the updated description file; generating an updated graph according to the description contents for each resource in the directed acyclic graph before and after updating and the description file before and after updating; and adjusting each resource needing to be arranged based on the description content aiming at each resource in the updated graph and the updated description file.
In some embodiments of the present invention, based on the foregoing solution, the step of generating an update graph according to the description contents for each resource in the directed acyclic graph before and after updating and the description file before and after updating includes: determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating; and generating the updated graph based on each changed vertex in the directed acyclic graph before and after updating.
In some embodiments of the present invention, based on the foregoing solution, the step of determining, according to the descriptions for the respective resources in the before-and-after-update directed acyclic graph and the before-and-after-update description file, each vertex that changes in the before-and-after-update directed acyclic graph includes: determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating; and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
In some embodiments of the present invention, based on the foregoing solution, the step of generating the updated graph based on each vertex that changes in the directed acyclic graph before and after the update includes: generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file; and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
In some embodiments of the present invention, based on the foregoing solution, the step of adjusting each resource to be arranged based on the description content of each resource in the updated graph and the updated description file includes:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
In some embodiments of the present invention, based on the foregoing scheme, the method further comprises: when the scheduled resources need to be deleted, the scheduled resources are sequentially deleted according to the dependency relationship among the scheduled resources.
In some embodiments of the present invention, based on the foregoing scheme, the step of sequentially deleting the scheduled resources according to the dependency relationship between the scheduled resources includes: obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources; based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
In a second aspect of embodiments of the present invention, there is provided a medium having a program stored thereon, which when executed by a processor, performs the method as described in the first aspect of the embodiments above.
In a third aspect of embodiments of the present invention, there is provided an apparatus for resource orchestration, including: the acquisition unit is used for acquiring the description file of the resource arrangement; the determining unit is used for determining the dependency relationship among the resources needing to be arranged based on the description file; and the processing unit is used for sequentially creating each resource according to the dependency relationship among the resources and the description content of each resource in the description file.
In some embodiments of the present invention, based on the foregoing solution, wherein the processing unit comprises: a first generating unit, configured to abstract the resources into vertices, and generate directed edges between the vertices according to the dependency relationships between the resources, so as to obtain a directed acyclic graph describing the dependency relationships between the resources; and the creating unit is used for sequentially creating each resource according to the directed acyclic graph and the description content of each resource.
In some embodiments of the present invention, based on the foregoing scheme, the creating unit is configured to: according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
In some embodiments of the present invention, based on the foregoing solution, the apparatus further includes: an adjustment unit; the acquiring unit is further configured to acquire the description file after the resource arrangement is updated; and the adjusting unit is used for adjusting each resource needing to be arranged according to the updated description file.
In some embodiments of the present invention, based on the foregoing solution, wherein the adjusting unit includes: the second generation unit is used for generating an updated directed acyclic graph according to the updated description file; a third generating unit, configured to generate an updated graph according to the description contents for each resource in the directed acyclic graph before and after updating and the description file before and after updating; and the execution unit is used for adjusting each resource needing to be arranged based on the description content aiming at each resource in the updated graph and the updated description file.
In some embodiments of the present invention, based on the foregoing scheme, wherein the third generating unit is configured to: determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating; and generating the updated graph based on each changed vertex in the directed acyclic graph before and after updating.
In some embodiments of the present invention, based on the foregoing scheme, wherein the third generating unit is configured to: determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating; and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
In some embodiments of the present invention, based on the foregoing scheme, wherein the third generating unit is configured to: generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file; and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
In some embodiments of the present invention, based on the foregoing scheme, the execution unit is configured to:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
In some embodiments of the present invention, based on the foregoing solution, the apparatus further includes: and the deleting unit is used for sequentially deleting the scheduled resources according to the dependency relationship among the scheduled resources when the scheduled resources need to be deleted.
In some embodiments of the present invention, based on the foregoing scheme, the deleting unit is configured to: obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources; based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
In a fourth aspect of embodiments of the present invention, there is provided a computing device comprising: a processor and a memory, the memory storing executable instructions, the processor being configured to invoke the memory stored executable instructions to perform the method according to the first aspect of the above embodiments.
According to the resource arranging method, medium, device and computing equipment, the dependency relationship among the resources to be arranged is determined based on the description file of the resource arrangement, and the resources are sequentially created according to the dependency relationship among the resources and the description content of the resources, so that the dependency relationship among the resources can be considered when the resources are arranged, the creation of the resources can be automatically realized based on the dependency relationship, the resource arranging efficiency is improved, and the resources can be conveniently managed. Meanwhile, the dependency relationship among the resources is determined, and the developed application can be ensured to normally run.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
FIG. 1 schematically shows a flow chart of a method of resource orchestration according to a first embodiment of the invention;
FIG. 2 schematically illustrates a flowchart of one embodiment of step S14 shown in FIG. 1;
FIG. 3 schematically shows a flow chart of a method of resource orchestration according to a second embodiment of the invention;
FIG. 4 schematically illustrates a flowchart of one embodiment of step S32 shown in FIG. 3;
FIG. 5 schematically shows a flow chart of a method of resource orchestration according to a third embodiment of the invention;
fig. 6 schematically shows a block diagram of an apparatus for resource orchestration according to an embodiment of the invention.
In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
Detailed Description
The principles and spirit of the present invention will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are given solely for the purpose of enabling those skilled in the art to better understand and to practice the invention, and are not intended to limit the scope of the invention in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, embodiments of the present invention may be embodied as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
According to the embodiment of the invention, a resource arranging method, a medium, a device and a computing device are provided.
In this document, it should be understood that the term "resource arrangement" refers to a process of submitting descriptions of required resources and related attributes of the resources in an arrangement file or the like according to business needs, further automatically completing initialization of the corresponding resources, and finally returning a whole set of initialized resources to a user.
The term "directed acyclic graph" refers to a directed graph that cannot go from a vertex back to the point through several edges.
Moreover, any number of elements in the drawings are by way of example and not by way of limitation, and any nomenclature is used solely for differentiation and not by way of limitation.
The principles and spirit of the present invention are explained in detail below with reference to several representative embodiments of the invention.
Summary of The Invention
The inventor finds that the current resource arrangement needs to be realized by a manual operation mode or a semi-automatic mode, so that the efficiency of business development and resource arrangement is low. In addition, the current resource arranging script only provides resources, and does not describe the relationship between the resources, which not only causes that the developed application may not be started normally, but also is difficult to manage the resources arranged for each service.
Therefore, the embodiment of the invention provides an improved resource arrangement scheme, which can improve the efficiency of resource arrangement and facilitate the management of each resource.
Having described the general principles of the invention, various non-limiting embodiments of the invention are described in detail below.
Application scene overview
It should be noted that the following application scenarios are merely illustrated to facilitate understanding of the spirit and principles of the present invention, and the embodiments of the present invention are not limited in this respect. Rather, embodiments of the present invention may be applied to any scenario where applicable.
When a user needs to perform resource arrangement, only a description file of the resource arrangement needs to be provided, and then the device or the computing equipment according to the embodiment of the invention can acquire the dependency relationship among the resources which need to be arranged according to the description file, and then sequentially create each resource according to the dependency relationship among the resources and the description content of each resource, so that not only is the efficiency of the resource arrangement improved, but also each created resource can be conveniently managed based on the dependency relationship among the resources.
When a user needs to adjust the resource arrangement, a new description file can be provided, and the device or the computing equipment according to the embodiment of the invention can adjust the arranged resource based on the new description file, thereby greatly facilitating the operation of the user.
Exemplary method
In the following, in conjunction with the above application scenarios, a method of resource orchestration according to an exemplary embodiment of the present invention is described with reference to fig. 1 to 5.
Fig. 1 schematically shows a flow chart of a method of resource orchestration according to a first embodiment of the invention.
Referring to fig. 1, a method of resource orchestration according to a first embodiment of the present invention comprises:
in step S10, a description file of the resource arrangement is obtained.
It should be noted that, in the embodiment of the present invention, the description file for arranging the resources mainly includes the description content of each resource to be arranged and the dependency relationship between each resource to be arranged.
And step S12, determining the dependency relationship among the resources needing to be arranged based on the description file.
In the embodiment of the present invention, for example, five resources are described A, B, C, D, E in the description file of the resource arrangement, and the dependency relationship is that B has dependency on a, C has dependency on a and D, and E has dependency on B and C, the dependency relationship between the resources A, B, C, D, E can be obtained based on the description file.
And step S14, sequentially creating the resources according to the dependency relationship between the resources and the description content of the resources in the description file.
According to an exemplary embodiment of the present invention, referring to fig. 2, step S14 includes:
step S142, abstracting each resource into a vertex.
Step S144, generating a directed edge between the vertices according to the dependency relationship between the resources to obtain a directed acyclic graph describing the dependency relationship between the resources.
The directed edges between the vertices point from the vertex corresponding to the resource being depended on to the vertex corresponding to the resource being depended on. For example, resource B has a dependency on resource a, the directed edge between the vertex corresponding to B and a points the vertex corresponding to a to the vertex corresponding to B.
And step S146, sequentially creating each resource according to the directed acyclic graph and the description content of each resource.
According to an exemplary embodiment of the present invention, step S146 includes: according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
In one embodiment of the present invention, in particular, it is assumed that resource B depends on resource a, resource C depends on resource a and resource D, and resource E depends on resource B and resource C. For convenience of explanation, the following description takes A, B, C, D, E as an example of vertices obtained by abstractions of various resources, and a directed acyclic graph generated based on the above dependency relationship can be represented as:
G0＝(V0,E0)
wherein, V0 { a, B, C, D, E }, E0 { < a, B >, < a, C >, < D, C >, < B, E >, < C, E > }. When the creation operation is performed, since neither a nor D has a predecessor point, resource a and resource D may be created first. When the resource A is completely created but the resource D is not completely created, the resource B is also created because the resource corresponding to the predecessor point A of B is already created. After the resource D is created, the resources (i.e., the resource a and the resource D) corresponding to the predecessor point of the resource C are completely created, and then the creation process of the resource C is executed. When both resource B and resource C are created, the creation process of resource E is executed.
Therefore, the resource arranging method can automatically realize the creation of the resources based on the dependency relationship among the resources, and effectively improve the efficiency of the resource arrangement.
Fig. 3 schematically shows a flow chart of a method of resource orchestration according to a second embodiment of the invention.
Referring to fig. 3, the method for scheduling resources according to the second embodiment of the present invention further includes, on the basis of steps S10, S12, and S14 shown in fig. 1:
step S30, acquiring the updated description file of the resource arrangement.
It should be noted that, when a user needs to adjust the arranged resource, the updated description file of the resource arrangement may be submitted. Of course, the description file after the resource arrangement update also includes the description content of each resource and the dependency relationship between each resource.
And step S32, adjusting each resource to be arranged according to the updated description file.
According to an exemplary embodiment of the present invention, referring to fig. 4, step S32 includes:
step S322, generating an updated directed acyclic graph according to the updated description file.
It should be noted that, in the process of generating the updated directed acyclic graph according to the updated description file, first abstracting each resource (here, each resource described in the updated description file) into a vertex, and then generating a directed edge between the vertices according to a dependency relationship between the resources, so as to obtain the updated directed acyclic graph.
The content of the updated description file changed compared with the description file before updating may include: the scheduled resources are increased, the scheduled resources are decreased, the dependency relationship between the resources is changed, and the description content of one or some of the resources is changed.
Step S324, an updated graph is generated according to the description contents for each resource in the directed acyclic graph before and after updating and the description file before and after updating.
In an exemplary embodiment of the present invention, step S324 includes: determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating; and generating the updated graph based on each changed vertex in the directed acyclic graph before and after updating.
It should be noted that the change of the directed acyclic graph before and after updating may include: the number of the vertexes is increased, the number of the vertexes is decreased, directed edges between the vertexes are changed, and the description content of a certain vertex or resources corresponding to certain vertexes is changed. Based on this, in some embodiments of the present invention, the step of determining, according to the descriptions for the respective resources in the before-update directed acyclic graph and the before-update description file, each vertex that changes in the before-update directed acyclic graph and the after-update directed acyclic graph includes:
determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating; and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
It should be noted that the third-class vertices that are included in the directed acyclic graph before and after the update and whose edges have changed are the vertices corresponding to the resources whose dependency has changed.
In some embodiments of the present invention, the step of generating the updated graph based on each vertex that changes in the directed acyclic graph before and after the update includes: generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file; and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
Specifically, for example, the directed acyclic graph before updating is G0 ═ in the above example (V0, E0), and the description file after updating the resource orchestration includes: resource A, B, C, E, F, where B has a dependency on A, C has a dependency on A, E has a dependency on both B and C and the description of C and E itself changes, F has a dependency on E and the description of A and B does not change. Based on this, an updated directed acyclic graph is obtained as G1 ═ (V1, E1), where V1 { a, B, C, E, F }, E1 { < a, B >, < a, C >, < B, E >, < C, E >, < E, F > }.
Assuming that the update map G '(V', E ') is first set to V1-V0 (F), then V' is added to the point C whose edge changes and belongs to V0 and V1, and V 'is added to the point E whose description content changes, where V' is { C, E, F }, where F is the first vertex, C is the third vertex, and E is the fourth vertex. E 'connects the vertexes in V' according to E1 to obtain E { < C, E >, < E, F > }, namely, according to the dependency described in the updated description file, directional edges among the first class vertex, the third class vertex and the fourth class vertex are generated. And finally, enabling V '═ V' + (V0-V1) ═ C, D, E, F }, wherein D is the vertex of the second type, and then generating a directed edge by E 'according to E0, wherein D and C, E, F are exchanged, so as to obtain E' { < C, E >, < E, F >, < C, D }.
With continued reference to fig. 4, step S32 further includes:
step S326, adjusting each resource to be arranged based on the description content for each resource in the updated graph and the updated description file.
According to an exemplary embodiment of the present invention, step S326 includes:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
Specifically, continuing with the above example, based on the update map G ' ═ V ', E ', C is operated first because there is no predecessor point. For C, since the corresponding resource is created and the new description content also exists, the resource C is updated according to the new description content. And after the resource C is updated, operating the D and the E because the resources corresponding to the precursor points of the D and the E are updated. The description content of the resource D does not exist in the description file which is created and updated by the resource D, so that the deletion operation is executed; and E, the corresponding resource is created and new description content also exists, so the resource E is updated according to the new description content. And after the resource E is updated, the resource corresponding to the precursor point of the F is updated, and because the resource corresponding to the F is not created, the creation operation is carried out on the resource corresponding to the F. When all the above operations are completed, the resource becomes A, B, C, E, F, neither A nor B is changed, C, E completes the update according to the new description, D is deleted, F is created, and the final result is consistent with the new description.
Fig. 5 schematically shows a flow chart of a method of resource orchestration according to a third embodiment of the invention.
Referring to fig. 5, a method of resource orchestration according to a third embodiment of the present invention comprises: and step S50, when the scheduled resources need to be deleted, sequentially deleting the scheduled resources according to the dependency relationship among the scheduled resources.
According to an exemplary embodiment of the present invention, step S50 includes: obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources; based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
It should be noted that, in the foregoing embodiment, according to the latest directed acyclic graph, the resources corresponding to the vertices without successors in the latest directed acyclic graph are deleted first, and then the resources corresponding to the deleted vertices of the resources corresponding to the successors are deleted in sequence, so that the created resources can be deleted in sequence based on the dependency relationship between the resources, the resource deletion process can be ensured to be performed in a orderly manner, and management of the resources is greatly facilitated.
Exemplary Medium
Having described the method of the exemplary embodiments of the present invention, the media of the exemplary embodiments of the present invention will be described next.
In some possible embodiments, aspects of the present invention may also be implemented as a medium having stored thereon program code for implementing steps in a method of resource orchestration according to various exemplary embodiments of the present invention described in the above section "exemplary methods" of this specification, when the program code is executed by a processor of a device.
Specifically, the processor of the device, when executing the program code, is configured to implement the following steps: acquiring a description file of resource arrangement; determining the dependency relationship among the resources needing to be arranged based on the description file; and sequentially creating each resource according to the dependency relationship among the resources and the description content aiming at each resource in the description file.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: abstracting the resources into vertexes; generating directed edges between the vertexes according to the dependency relationship among the resources to obtain a directed acyclic graph describing the dependency relationship among the resources; and sequentially creating each resource according to the directed acyclic graph and the description content of each resource.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
In some embodiments of the invention, the program code is further configured to, when executed by the processor of the device, perform the following steps: acquiring a description file after resource arrangement updating; and adjusting each resource needing to be arranged according to the updated description file.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: generating an updated directed acyclic graph according to the updated description file; generating an updated graph according to the description contents for each resource in the directed acyclic graph before and after updating and the description file before and after updating; and adjusting each resource needing to be arranged based on the description content aiming at each resource in the updated graph and the updated description file.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating; and generating the updated graph based on each changed vertex in the directed acyclic graph before and after updating.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating; and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file; and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
In some embodiments of the invention, the program code is further configured to, when executed by the processor of the device, perform the following steps: when the scheduled resources need to be deleted, the scheduled resources are sequentially deleted according to the dependency relationship among the scheduled resources.
In some embodiments of the invention, the program code is executable by a processor of the device to perform the steps of: obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources; based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
It should be noted that: the above-mentioned medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take a variety of forms, including, but not limited to: an electromagnetic signal, an optical signal, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device over any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., over the internet using an internet service provider).
Exemplary devices
Having described the medium of an exemplary embodiment of the present invention, an apparatus for resource orchestration according to an exemplary embodiment of the present invention is described next with reference to fig. 6.
Fig. 6 schematically shows a block diagram of an apparatus for resource orchestration according to an embodiment of the invention.
Referring to fig. 6, an apparatus 600 for resource orchestration according to an embodiment of the present invention includes: an acquisition unit 602, a determination unit 604 and a processing unit 606.
Specifically, the obtaining unit 602 is configured to obtain a description file of resource arrangement; the determining unit 604 is configured to determine, based on the description file, a dependency relationship between resources that need to be arranged; the processing unit 606 is configured to sequentially create the resources according to the dependency relationships between the resources and the description contents of the resources in the description file.
In some embodiments of the present invention, based on the foregoing solution, wherein the processing unit 606 includes: a first generation unit 6062 and a creation unit 6064.
Specifically, the first generating unit 6062 is configured to abstract the resources into vertices, and generate directed edges between the vertices according to the dependency relationships between the resources to obtain a directed acyclic graph describing the dependency relationships between the resources; a creating unit 6064 is configured to sequentially create the resources according to the directed acyclic graph and the description content of each resource.
In some embodiments of the present invention, based on the foregoing scheme, the creating unit 6064 is configured to: according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
In some embodiments of the present invention, based on the foregoing solution, the apparatus 600 further includes: an adjustment unit 608; the obtaining unit 602 is further configured to obtain a description file after the resource orchestration is updated; the adjusting unit 608 is configured to adjust each resource that needs to be arranged according to the updated description file.
In some embodiments of the present invention, based on the foregoing solution, wherein the adjusting unit 608 includes: a second generation unit 6082, a third generation unit 6084, and an execution unit 6086.
Specifically, the second generating unit 6082 is configured to generate an updated directed acyclic graph according to the updated description file; a third generating unit 6084, configured to generate an update graph according to the description contents for each resource in the directed acyclic graph before and after update and the description file before and after update; an executing unit 6086, configured to adjust each resource that needs to be arranged based on the description content for each resource in the updated graph and the updated description file.
In some embodiments of the present invention, based on the foregoing solution, wherein the third generating unit 6084 is configured to: determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating; and generating the updated graph based on each changed vertex in the directed acyclic graph before and after updating.
In some embodiments of the present invention, based on the foregoing solution, wherein the third generating unit 6084 is configured to: determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating; and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
In some embodiments of the present invention, based on the foregoing solution, wherein the third generating unit 6084 is configured to: generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file; and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
In some embodiments of the present invention, based on the foregoing solution, wherein the execution unit 6086 is configured to:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
In some embodiments of the present invention, based on the foregoing solution, the apparatus 600 further includes: a deleting unit 610, configured to delete the scheduled resources in sequence according to the dependency relationship between the scheduled resources when the scheduled resources need to be deleted.
In some embodiments of the present invention, based on the foregoing scheme, the deleting unit 610 is configured to: obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources; based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
Exemplary computing device
Having described the method, medium, and apparatus of exemplary embodiments of the present invention, a computing device in accordance with another exemplary embodiment of the present invention is described.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
In some possible implementations, a computing device according to an embodiment of the invention may include at least one processor, and at least one memory. Wherein the memory stores program code which, when executed by the processor, causes the processor to perform the steps in the method of resource orchestration according to various exemplary embodiments of the present invention described in the "exemplary methods" section above in this specification. For example, the processor may execute step S10 shown in fig. 1 to obtain a description file of the resource arrangement; step S12, determining the dependency relationship among the resources needing to be arranged based on the description file; and step S14, sequentially creating the resources according to the dependency relationship between the resources and the description content of the resources in the description file. As another example, the processor may also perform the steps shown in fig. 2-5.
It should be noted that although in the above detailed description several units or sub-units of the apparatus of the resource orchestration are mentioned, such a division is merely exemplary and not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit according to embodiments of the invention. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, while the operations of the method of the invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
While the spirit and principles of the invention have been described with reference to several particular embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (18)

1. A method of resource orchestration, comprising:
acquiring a description file of resource arrangement;
determining the dependency relationship among the resources needing to be arranged based on the description file;
sequentially creating each resource according to the dependency relationship among the resources and the description content aiming at each resource in the description file;
acquiring a description file after resource arrangement updating, and generating an updated directed acyclic graph; determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating; generating an updated graph based on each vertex which is changed in the directed acyclic graph before and after updating; and adjusting each resource needing to be arranged based on the description content aiming at each resource in the updated graph and the updated description file.
2. The method according to claim 1, wherein the step of sequentially creating the resources according to the dependency relationship between the resources and the description contents of the description file for the resources comprises:
abstracting the resources into vertexes;
generating directed edges between the vertexes according to the dependency relationship among the resources to obtain a directed acyclic graph describing the dependency relationship among the resources;
and sequentially creating each resource according to the directed acyclic graph and the description content of each resource.
3. The method of claim 2, wherein the step of creating the resources in sequence according to the directed acyclic graph and the description content of the resources comprises:
according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
4. The method according to claim 1, wherein the step of determining each vertex that changes in the before-and-after-update directed acyclic graph according to the before-and-after-update directed acyclic graph and the description contents for each resource in the before-and-after-update description file comprises:
determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating;
and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
5. The method of claim 4, wherein generating the updated graph based on vertices in the directed acyclic graph before and after updating that have changed comprises:
generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file;
and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
6. The method according to claim 1, wherein the step of adjusting each resource to be arranged based on the description content for each resource in the updated graph and the updated description file comprises:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
7. The method of any of claims 1 to 6, further comprising:
when the scheduled resources need to be deleted, the scheduled resources are sequentially deleted according to the dependency relationship among the scheduled resources.
8. The method of claim 7, wherein the step of sequentially deleting the scheduled resources according to the dependencies between the scheduled resources comprises:
obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources;
based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
9. A medium having stored thereon a program which, when executed by a processor, carries out the method of any one of claims 1 to 8.
10. An apparatus of resource orchestration, comprising:
the acquisition unit is used for acquiring the description file of the resource arrangement;
the determining unit is used for determining the dependency relationship among the resources needing to be arranged based on the description file;
the processing unit is used for sequentially creating each resource according to the dependency relationship among the resources and the description content of each resource in the description file;
wherein the apparatus further comprises: an adjustment unit;
an adjusting unit: the system is used for adjusting each resource needing to be arranged according to the updated description file;
wherein the adjusting unit includes:
the second generation unit is used for generating an updated directed acyclic graph according to the updated description file;
a third generating unit, configured to generate an updated graph according to the description contents for each resource in the directed acyclic graph before and after updating and the description file before and after updating;
the execution unit is used for adjusting each resource needing to be arranged based on the description content aiming at each resource in the updated graph and the updated description file;
wherein the third generating unit is configured to:
determining each changed vertex in the directed acyclic graph before and after updating according to the directed acyclic graph before and after updating and the description content aiming at each resource in the description file before and after updating;
an updated graph is generated based on each vertex that changes in the directed acyclic graph before and after the update.
11. The apparatus of claim 10, wherein the processing unit comprises:
a first generating unit, configured to abstract the resources into vertices, and generate directed edges between the vertices according to the dependency relationships between the resources, so as to obtain a directed acyclic graph describing the dependency relationships between the resources;
and the creating unit is used for sequentially creating each resource according to the directed acyclic graph and the description content of each resource.
12. The apparatus of claim 11, wherein the creating unit is configured to:
according to the description content of each resource, firstly creating the resource corresponding to the vertex without the precursor point in the directed acyclic graph, and then sequentially creating the resource corresponding to the created vertex of the resource corresponding to the precursor point.
13. The apparatus of claim 12, wherein the third generating unit is configured to:
determining a first type of vertex and a second type of vertex which are increased and decreased in the updated directed acyclic graph compared with the directed acyclic graph before updating and a third type of vertex which is provided in the directed acyclic graph before and after updating and has changed edges according to the directed acyclic graph before and after updating;
and determining fourth type vertexes which are contained in the directed acyclic graphs before and after updating and correspond to the changed description contents of the resources according to the description contents of the directed acyclic graphs before and after updating and the description files before and after updating and aiming at the resources.
14. The apparatus of claim 13, wherein the third generating unit is configured to:
generating directed edges among the first type of vertex, the third type of vertex and the fourth type of vertex according to the dependency relationship described in the updated description file;
and generating directed edges after the direction of the first type of vertex, the third type of vertex and the fourth type of vertex is exchanged with the direction of the second type of vertex according to the dependency relationship described in the description file before updating.
15. The apparatus of claim 10, wherein the execution unit is configured to:
if the resource corresponding to any vertex in the updated graph is not created and the updated description file has the description content of the resource corresponding to the vertex, creating the resource corresponding to the vertex;
if the resource corresponding to any vertex in the updated graph is created and the updated description file has the description content of the resource corresponding to any vertex, updating the resource corresponding to any vertex according to the description content of the resource corresponding to any vertex in the updated description file;
and if the resource corresponding to any vertex in the updated graph is created and the updated description file does not have the description content of the resource corresponding to any vertex, deleting the resource corresponding to any vertex.
16. The apparatus of any of claims 10 to 15, further comprising:
and the deleting unit is used for sequentially deleting the scheduled resources according to the dependency relationship among the scheduled resources when the scheduled resources need to be deleted.
17. The apparatus of claim 16, wherein the deletion unit is configured to:
obtaining an up-to-date directed acyclic graph describing dependencies between the orchestrated resources;
based on the latest directed acyclic graph, deleting the resources corresponding to the vertexes without the successors in the latest directed acyclic graph, and then deleting the resources corresponding to the vertexes with the deleted resources corresponding to the successors in sequence.
18. A computing device, comprising: a processor and a memory, the memory storing executable instructions, the processor to invoke the memory-stored executable instructions to perform the method of any of claims 1 to 8.
CN201710702299.9A 2017-08-16 2017-08-16 Resource arrangement method, medium, device and computing equipment Active CN107526639B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710702299.9A CN107526639B (en) 2017-08-16 2017-08-16 Resource arrangement method, medium, device and computing equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710702299.9A CN107526639B (en) 2017-08-16 2017-08-16 Resource arrangement method, medium, device and computing equipment

Publications (2)

Publication Number Publication Date
CN107526639A CN107526639A (en) 2017-12-29
CN107526639B true CN107526639B (en) 2021-07-09

Family

ID=60681370

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710702299.9A Active CN107526639B (en) 2017-08-16 2017-08-16 Resource arrangement method, medium, device and computing equipment

Country Status (1)

Country Link
CN (1) CN107526639B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108805527A (en) * 2018-05-29 2018-11-13 郑州云海信息技术有限公司 A kind of project management method and device
CN109471616A (en) * 2018-10-26 2019-03-15 数贸科技（北京）有限公司 Method of combination and device are applied based on application Jar APMB package
CN109445923A (en) * 2018-11-01 2019-03-08 郑州云海信息技术有限公司 A kind of method and device of micro services task schedule
CN109471729B (en) * 2018-11-15 2024-05-14 平安科技（深圳）有限公司 Resource cleaning method and device based on recursion

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101640613A (en) * 2009-09-11 2010-02-03 中兴通讯股份有限公司 Method and device for network resource relating management
CN102541875A (en) * 2010-12-16 2012-07-04 北京大学 Access method, device and system for relational node data of directed acyclic graph
CN105007323A (en) * 2015-07-22 2015-10-28 上海斐讯数据通信技术有限公司 System and method for arranging cloud resources
CN105824746A (en) * 2015-01-05 2016-08-03 中国移动（深圳）有限公司 Method and device for automatically generating test scheduling based on use case dependencies
CN106155791A (en) * 2016-06-30 2016-11-23 电子科技大学 A kind of workflow task dispatching method under distributed environment

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8937886B2 (en) * 2010-12-17 2015-01-20 Cisco Technology, Inc. Dynamic reroute scheduling in a directed acyclic graph (DAG)
US11347704B2 (en) * 2015-10-16 2022-05-31 Seven Bridges Genomics Inc. Biological graph or sequence serialization
CN106250650A (en) * 2016-08-15 2016-12-21 北京理工大学 The resource allocation and optimization method of model in high flux emulation
CN106775830B (en) * 2016-11-25 2017-12-26 魏熙柠 A kind of web application page script resource automatic update method and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101640613A (en) * 2009-09-11 2010-02-03 中兴通讯股份有限公司 Method and device for network resource relating management
CN102541875A (en) * 2010-12-16 2012-07-04 北京大学 Access method, device and system for relational node data of directed acyclic graph
CN105824746A (en) * 2015-01-05 2016-08-03 中国移动（深圳）有限公司 Method and device for automatically generating test scheduling based on use case dependencies
CN105007323A (en) * 2015-07-22 2015-10-28 上海斐讯数据通信技术有限公司 System and method for arranging cloud resources
CN106155791A (en) * 2016-06-30 2016-11-23 电子科技大学 A kind of workflow task dispatching method under distributed environment

Also Published As

Publication number Publication date
CN107526639A (en) 2017-12-29

Similar Documents

Publication Publication Date Title
US8799477B2 (en) Hypervisor selection for hosting a virtual machine image
US8494996B2 (en) Creation and revision of network object graph topology for a network performance management system
CN107526639B (en) Resource arrangement method, medium, device and computing equipment
US9852035B2 (en) High availability dynamic restart priority calculator
CN111831287B (en) Method, apparatus and program product for determining resources required to execute a code segment
US11029975B2 (en) Automated container image assembly
US10901804B2 (en) Apparatus and method to select services for executing a user program based on a code pattern included therein
JP2020535517A (en) Methods for job processing in quantum computing-enabled cloud environments, quantum cloud environments (QCE), and computer programs
CN111832736A (en) Method, apparatus and computer program product for processing machine learning models
US8458657B2 (en) Documentation roadmaps and community networking for developers on large projects
CN112328301B (en) Method and device for maintaining consistency of operating environments, storage medium and electronic equipment
US11461291B2 (en) Method, electronic device and computer program product for processing machine learning model
WO2022100439A1 (en) Workflow patching
CN113568605B (en) Method, device and system for configuring defined route
CN115994085A (en) Code coverage rate test processing method, device, equipment and storage medium
US8984476B2 (en) Target application creation
WO2023056793A1 (en) Optimizing a just-in-time compilation process
CN111352664A (en) Distributed machine learning task starting method, system, equipment and storage medium
CN115562686A (en) Lightweight packaging method, system, terminal and storage medium for Springboot project
US11640281B2 (en) Tool for introspection in object-oriented source code
US20210182041A1 (en) Method and apparatus for enabling autonomous acceleration of dataflow ai applications
CN115291928A (en) Task automatic integration method and device of multiple technology stacks and electronic equipment
CN113127430B (en) Mirror image information processing method, mirror image information processing device, computer readable medium and electronic equipment
US20160359726A1 (en) Quantifying and designing optimal connecting networks
CN111078263A (en) Hot deployment method, system, server and storage medium based on Drools rule engine

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP01 Change in the name or title of a patent holder

Address after: 310052 Room 301, Building No. 599, Changhe Street Network Business Road, Binjiang District, Hangzhou City, Zhejiang Province

Patentee after: Hangzhou NetEase Shuzhifan Technology Co.,Ltd.

Address before: 310052 Room 301, Building No. 599, Changhe Street Network Business Road, Binjiang District, Hangzhou City, Zhejiang Province

Patentee before: HANGZHOU LANGHE TECHNOLOGY Ltd.

CP01 Change in the name or title of a patent holder