CN115795208A

CN115795208A - Resource processing method and device, electronic equipment and storage medium

Info

Publication number: CN115795208A
Application number: CN202211235281.XA
Authority: CN
Inventors: 朱长皓; 郑振宇
Original assignee: Beijing Dajia Internet Information Technology Co Ltd
Current assignee: Beijing Dajia Internet Information Technology Co Ltd
Priority date: 2022-10-10
Filing date: 2022-10-10
Publication date: 2023-03-14

Abstract

The method responds to a resource release request, and obtains graph information of a graph to be executed, wherein the graph to be executed is created based on a preset operator, and the preset operator comprises an operator for realizing resource release. Executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put the target resource into the target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource position is the resource position defined by the graph to be executed. Therefore, the pre-created operator to be executed is executed, so that the resource releasing operation of releasing the target resource to the target resource position can be realized, and the resource releasing can be realized more efficiently. And the resource delivery is realized in a DAG (directed markup language) graph mode, so that developers can select a preset operator to create a graph to be executed according to needs to realize resource delivery logic, the resource delivery realization cost can be reduced to a certain extent, and the realization efficiency is further improved.

Description

Resource processing method and device, electronic equipment and storage medium

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a resource processing method and apparatus, an electronic device, and a storage medium.

Background

With the continuous development of network technology, more and more application programs are provided for users to use, and the users can use the application programs to meet diversified use requirements. In an actual use scene, in order to enable a user to conveniently obtain resources through an application program, resource positions are set in pages of many application programs, and resources are displayed to the user by releasing the resources for the resource positions.

Therefore, how to implement resource delivery to the resource bit more efficiently becomes a technical problem which needs to be solved urgently.

Disclosure of Invention

The present disclosure provides a resource processing method, a resource processing apparatus, an electronic device, and a storage medium, so as to at least solve a problem of how to implement resource placement on a resource slot more efficiently. The technical scheme of the disclosure is as follows:

according to a first aspect of the embodiments of the present disclosure, there is provided a resource processing method, including:

responding to a resource release request, and acquiring graph information of a graph to be executed; the graph to be executed is created based on a preset operator, and the preset operator comprises an operator for realizing resource delivery;

according to the graph information of the graph to be executed, executing an operator included in the graph to be executed so as to put target resources into a target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource bit is a resource bit defined by the graph to be executed.

Optionally, the graph information includes dependency description information and configuration information of an operator in the graph to be executed; the executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put a target resource into a target resource bit includes:

generating an operator execution sequence corresponding to the graph to be executed according to the dependency description information;

and sequentially taking the operators in the operator execution sequence as operators to be executed, and executing the operators to be executed according to the configuration information so as to put the target resource into the target resource position.

Optionally, the configuration information includes operator configuration information; the executing the operator to be executed according to the configuration information to release the target resource to the target resource bit includes:

if the operator to be executed is a recall operator, operating an execution class of the recall operator based on a resource data source indicated by the operator configuration information so as to recall resources from the resource data source;

if the operator to be executed is a resource bit operator, operating an execution class of the resource bit operator based on resource bit information in the operator configuration information to determine a target resource bit corresponding to the recalled resource;

if the operator to be executed is a sequencing operator, operating an execution class of the sequencing operator based on sequencing information in operator configuration information so as to sequence recalled resources corresponding to each target resource bit;

and if the operator to be executed is a release operator, operating the execution class of the release operator within the operation time length defined by the operator configuration information so as to take the recalled resource with the ranking meeting the preset requirement as the target resource and release the recalled resource to the target resource position.

Optionally, the configuration information further includes an overall graph configuration, where the overall graph configuration includes an overall execution duration of the graph to be executed and a graph configuration parameter; the method further comprises the following steps:

outputting error reporting information under the condition that the execution duration of the graph to be executed exceeds the integral execution duration;

creating a graph execution environment for the graph to be executed based on the graph configuration parameters;

the executing the operator included in the graph to be executed according to the graph information of the graph to be executed comprises the following steps: in the graph execution environment, according to the graph information of the graph to be executed, executing an operator included in the graph to be executed.

Optionally, the method further includes:

receiving and storing graph information of a resource release directed acyclic DAG graph sent by a creation end; the graph information of the resource delivery DAG graph is sent by the creating end according to a pre-agreed graph protocol;

the acquiring of the graph information of the graph to be executed includes: and obtaining the graph information of the resource release DAG graph indicated by the resource release request from the stored graph information of the resource release DAG graph.

Optionally, the resource delivery DAG graph is obtained by displaying operator options according to preset operators in a preset operator library by the creation end in response to the graph creation operation, and arranging the preset operators indicated by the operator options according to the operator arrangement operation in response to the operator arrangement operation;

the preset operators in the preset operator library comprise general operators and custom operators.

According to a second aspect of the embodiments of the present disclosure, there is provided a resource processing apparatus, including:

the acquisition module is configured to respond to the resource release request and acquire the graph information of the graph to be executed; the graph to be executed is created based on a preset operator, and the preset operator comprises an operator for realizing resource delivery;

the execution module is configured to execute an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put the target resource into a target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource bit is a resource bit defined by the graph to be executed.

Optionally, the graph information includes dependency description information and configuration information of an operator in the graph to be executed; the execution module is specifically configured to:

Optionally, the configuration information includes operator configuration information; the execution module is specifically further configured to:

if the operator to be executed is a resource bit operator, operating an execution class of the resource bit operator based on resource bit information in operator configuration information to determine a target resource bit corresponding to the recalled resource;

if the operator to be executed is a sequencing operator, operating an execution class of the sequencing operator based on sequencing information in the operator configuration information so as to sequence recalled resources corresponding to each target resource bit;

and if the operator to be executed is a release operator, operating the execution class of the release operator within the operation time length defined by the operator configuration information, so as to take the recalled resource with the ranking meeting the preset requirement as the target resource, and releasing the recalled resource to the target resource position.

Optionally, the configuration information further includes an overall graph configuration, where the overall graph configuration includes an overall execution duration of the graph to be executed and a graph configuration parameter; the device further comprises:

the output module is configured to output error reporting information under the condition that the execution duration of the graph to be executed exceeds the whole execution duration;

a creation module configured to create a graph execution environment for the graph to be executed based on the graph configuration parameters;

the execution module is specifically further configured to: in the graph execution environment, according to the graph information of the graph to be executed, executing an operator included in the graph to be executed.

Optionally, the apparatus further comprises:

the receiving module is configured to receive and store graph information of the resource launching directed acyclic DAG graph sent by the creating end; the graph information of the resource delivery DAG graph is sent by the creating end according to a pre-agreed graph protocol;

the acquisition module is specifically configured to: and obtaining the graph information of the resource release DAG graph indicated by the resource release request from the stored graph information of the resource release DAG graph.

Optionally, the resource delivery DAG graph is obtained by the creating end displaying operator options according to preset operators in a preset operator library in response to the graph creating operation, and arranging, in response to the operator arranging operation, the preset operators indicated by the operator options selected by the operator arranging operation;

According to a third aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:

a processor;

a memory for storing the processor-executable instructions;

wherein the processor is configured to execute the instructions to implement the method of any of the first aspects.

According to a fourth aspect of embodiments of the present disclosure, there is provided a storage medium, wherein instructions, when executed by a processor of an electronic device, cause the electronic device to perform the method according to any one of the first aspect.

According to a fifth aspect of embodiments of the present disclosure, there is provided a computer program product comprising readable program instructions which, when executed by a processor of an electronic device, cause the electronic device to perform the method according to any one of the first aspect.

The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects: in the embodiment of the present disclosure, in response to a resource release request, a resource processing method provided in the embodiment of the present disclosure obtains graph information of a graph to be executed, where the graph to be executed is created based on a preset operator, and the preset operator includes an operator for implementing resource release. Executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put the target resource into the target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource position is the resource position defined by the graph to be executed. Therefore, the pre-created operator to be executed is executed, so that the resource releasing operation of releasing the target resource to the target resource position can be realized, and the resource releasing can be realized more efficiently.

And moreover, the resource release is realized in a DAG (direct current) graph mode, so that developers can directly select a preset operator to create a graph to be executed according to needs in a development link, and then the resource release logic can be realized.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.

FIG. 1 is a flow diagram illustrating a resource handling method in accordance with an exemplary embodiment;

FIG. 2 is a process flow diagram, shown in accordance with an exemplary embodiment;

FIG. 3 is a schematic diagram illustrating another process flow according to an exemplary embodiment;

FIG. 4 is a schematic diagram of a scenario shown in accordance with an exemplary embodiment;

FIG. 5 is a block diagram illustrating a resource processing apparatus in accordance with an exemplary embodiment;

FIG. 6 is a block diagram illustrating an apparatus for resource processing in accordance with an exemplary embodiment;

FIG. 7 is a block diagram illustrating another apparatus for resource processing in accordance with an example embodiment.

Detailed Description

In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.

It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below do not represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.

Fig. 1 is a flowchart illustrating a resource processing method according to an exemplary embodiment, which may include the following steps, as shown in fig. 1:

step 101, responding to a resource release request, and acquiring graph information of a graph to be executed; the graph to be executed is created based on preset operators, and the preset operators comprise operators for realizing resource delivery.

The resource processing method provided by the embodiment of the disclosure can be applied to backend services, and particularly, can be applied to an execution engine in the backend services. The resource release request in this step may be sent by the user side. For example, when a specified page of a preset application is opened in response to a user operation, a resource release request may be generated and sent to the execution engine to control the execution engine to release resources to resource slots included in the specified page in response to the received resource release request. The resource position may refer to a resource release position for showing released resources, and a specific released resource type may be set according to an actual requirement, for example, the released resources may include virtual articles, videos, notification information, and the like.

The resource release request may carry a bit identifier of a resource bit in the designated page, and accordingly, a DAG Graph corresponding to the bit identifier carried in the resource release request may be determined according to a correspondence between the bit identifier and a pre-created Directed Acyclic Graph (DAG), and the corresponding DAG Graph is used as a Graph to be executed. Wherein, the DAG graph refers to a directed acyclic graph. Then, graph information of a graph to be executed is read from graph information of a DAG graph created in advance. The pre-created DAG graph may include multiple DAG graphs for implementing resource placement logic, and the resource placement logic implemented by different DAG graphs may have differences, for example, different types of placed resources, different resource recall algorithms used, and the like. Therefore, by setting a plurality of DAG graphs for realizing the resource delivery logic, diversified delivery requirements can be met. The graph information of each pre-created DAG graph may be pre-generated, the graph information may include information required when executing the DAG graph, and the graph information may include information for describing the DAG graph.

Specifically, the graph to be executed may include a plurality of nodes, and one node is one functional operator, and therefore, the node may also be referred to as an operator node. The preset operators include functional operators for realizing resource delivery, and can be pre-established in a development stage, one preset operator is a code class, and the preset operators can be specifically classes obtained through service abstraction and used for realizing certain service function logic. Different preset operators included in the graph to be executed can be used for realizing a part of functional logics in the resource releasing flow, and correspondingly, the total sum of the functional logics realized by all the operators in the graph to be executed can realize the whole functional logics of the resource releasing flow, so that the resource releasing operation of the resource position indicated by the resource releasing request is realized.

102, executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to release target resources to a target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource bit is the resource bit defined by the graph to be executed.

In the embodiment of the present disclosure, the target resource bit defined by the graph to be executed is a resource bit indicated by the bit identifier carried in the resource release request, and one or more target resource bits may be used. The to-be-launched resource defined by the to-be-executed graph can include a plurality of resources, and a target resource suitable for the target resource position can be selected from the plurality of to-be-launched resources by executing an operator included in the to-be-executed graph so as to be launched to the target resource position. The problem of matching between a plurality of resources to be released and a small number of resource positions is solved through resource releasing.

To sum up, in the resource processing method provided by the embodiment of the present disclosure, in response to a resource release request, graph information of a graph to be executed is obtained, where the graph to be executed is created based on a preset operator, and the preset operator includes an operator for implementing resource release. Executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put the target resource into the target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource position is the resource position defined by the graph to be executed. Therefore, the resource releasing operation of releasing the target resource to the target resource position can be realized by executing the operator to be executed, which is created in advance, and then the resource releasing is realized more efficiently.

And moreover, the resource delivery is realized in a DAG (directed DAG) graph mode, so that developers can directly select a preset operator to create a graph to be executed according to needs in a development link, and then the resource delivery logic can be realized.

Optionally, the graph information includes dependency description information and configuration information of an operator in the graph to be executed. The above operation of executing the operator included in the to-be-executed graph according to the graph information of the to-be-executed graph to put the target resource into the target resource bit may specifically include:

and 1021, generating an operator execution sequence corresponding to the graph to be executed according to the dependency description information.

The dependency description information may be used to characterize a dependency between operators in the graph to be executed, and for example, assuming that after an operator a included in the graph to be executed is executed, an operator B included in the graph to be executed needs to be processed based on an execution result of the operator a, it may be considered that the operator B depends on the operator a, and the operator B may be considered as a successor node of the operator a. Correspondingly, operators in the graph to be executed can be added into the operator execution sequence according to the dependency described by the dependency description information, wherein each operator is located behind the dependent operator, and the earlier the execution sequence of the earlier operator is, correspondingly, the earlier the operator is executed, so that the execution sequence is ensured to be matched with the dependency, and the problem of execution error caused by executing the operator under the condition that the dependent operator is not executed is avoided.

Further, in the embodiment of the present disclosure, a breadth first algorithm may also be adopted to traverse the graph to be executed. Specifically, the traversal may be performed according to the degree of entry being 0, and on the basis of the execution sequence obtained by the traversal, the adjustment may be performed according to the dependency described by the dependency description information, specifically, the adjustment may be performed according to a manner in which the dependent operator is located before, so as to ensure that each operator is located behind the dependent operator. Therefore, adjustment is carried out on the basis of breadth-first traversal, and the generation efficiency of the operator execution sequence can be improved to a certain extent.

In the embodiment of the present disclosure, nodes in a DAG graph may be connected based on edges, and different styles of edges may represent different processing manners, for example, a solid edge represents a node pointed by the edge, and a dotted edge represents no condition, that is, the node pointed by the edge is not executed when a specified condition is satisfied. Correspondingly, when the operator execution sequence is generated, whether the specified condition is met or not can be detected, and under the condition that the specified condition is met, the operators represented by the nodes pointed by the dotted line edges are removed from the execution sequence.

It should be noted that, in the embodiment of the present disclosure, in a graph execution environment created for a graph to be executed, an operation of generating an operator execution sequence corresponding to the graph to be executed according to the dependency description information and a subsequent operation thereof may be executed. The graph execution environment may provide the underlying support for running the graph to be executed.

And 1022, sequentially using the operators in the operator execution sequence as the operators to be executed, and executing the operators to be executed according to the configuration information so as to deliver the target resource to the target resource position.

In this step, the operator execution class of the operator to be executed may be obtained first, and the operator execution class of the operator to be executed is operated according to the configuration information, so as to implement execution of the operator to be executed. The operators can be used as the operators to be executed in sequence according to the sequence of the operators in the operator execution sequence. And calling the operator to be executed into the thread pool for execution. It should be noted that the graph execution engine may execute multiple DAG graphs simultaneously, and thus, the thread pool may include multiple threads. The thread pool can also perform concurrent control, so that the running error caused by a large number of threads is avoided.

An execution thread can be created for the operator to be executed, so as to obtain the operator execution class of the operator to be executed, and execute the operator to be executed. In the embodiment of the present disclosure, operators in an operator execution sequence may also be called into a thread pool (ThreadPool) in parallel, so as to improve call efficiency. The execution thread of each operator calls the operator engine based on an operator (operator) in the thread pool. Accordingly, the operator engine, in response to the call operation, obtains the execution class corresponding to each operator from the operator loading library. And provide the obtained execution class as a result to the operator, for example, the obtained execution class may be actively returned to the operator of the execution thread, or returned in response to the result obtaining request, which is not limited in this disclosure. And then, sequentially taking the operators as the execution threads of the operators to be executed according to the sequence of the operators in the operator execution sequence, and operating the execution classes according to the configuration information, thereby realizing the sequential operation of the execution classes of the operators according to the sequence. The thread pool may return execution results of the operators and ultimately return final execution results of the DAG graph. The final execution result may include the target resource placed in the target resource slot.

The execution class may also be referred to as an operator execution class, which is a code class constituting an operator. Correspondingly, by operating all operators in the graph to be executed, the whole resource releasing process can be realized, and then the target resource can be released to the target resource position.

In the embodiment of the present disclosure, the definition map information includes dependency description information and configuration information of an operator in the graph to be executed, and an operator execution sequence corresponding to the graph to be executed is generated according to the dependency description information. And taking the operators in the operator execution sequence as operators to be executed in sequence, and executing the operators to be executed according to the configuration information so as to release the target resources to the target resource positions. Therefore, information required for operating the graph to be executed for realizing resource delivery can be provided to a certain extent, the operator execution sequence is generated according to the dependency description information, execution is carried out based on the configuration information, the graph to be executed can be smoothly executed, and the resource delivery is prevented from being abnormal as far as possible.

Optionally, in an implementation scenario, the graph to be executed may include a recall operator, a resource bit operator, a sort operator, and a launch operator. During execution, the recall operator may be executed first, followed by the resource bit operator, followed by the sort operator, and finally the launch operator. The aforementioned configuration information may include operator configuration information. Correspondingly, the step of executing the operator to be executed according to the configuration information to deliver the target resource to the target resource bit may specifically include:

step 1022a, if the operator to be executed is a recall operator, running an execution class of the recall operator based on a resource data source indicated by the operator configuration information, so as to recall resources from the resource data source.

In the embodiment of the present disclosure, the operator configuration information of the recall operator may include a source identifier indicating a resource data source. Illustratively, when the recall operator is executed, an operation parameter of the execution class of the recall operator is set based on the source identification of the resource data source, for example, the source identification is taken as a parameter value of the operation parameter to indicate that the resource is recalled from the resource data source indicated by the operator configuration information. After the setting is completed, the execution class can be run in a code running mode, and then the resource included in the resource data source is recalled. The specific recall logic may be implemented in advance based on the code in the execution class, for example, the M resources with the highest quality scores may be used, and the embodiment of the present disclosure does not limit this.

And 1022b, if the operator to be executed is a resource bit operator, running the execution class of the resource bit operator based on the resource bit information in the operator configuration information to determine a target resource bit corresponding to the recalled resource.

After the recall operator is executed, the resource bit operator can be treated as an operator to be executed. Resource bit operator can also be called as pit-fixing operator, and operator configuration information of the resource bit operator can include resource bit information, and the resource bit information can be used to represent the resource type that each target resource bit needs to be launched, for example, assuming that there are target resource bit 1 and target resource bit 2, the resource bit information can include the resource type that is used to represent target resource bit 1 and needs to be launched: the corresponding relation between the videos, and the corresponding relation is used for representing the target resource position 2 and the type of the resource needing to be released: correspondence between virtual items.

Accordingly, an operating parameter of an execution class of a resource bit operator may be set based on the resource bit information, e.g., as a parameter value of the operating parameter. And operating the execution class of the resource bit operator in a code operation mode to determine a target resource bit corresponding to each recalled resource according to the corresponding relations. Illustratively, the target resource bit corresponding to the recalled video resource may be determined to be target resource bit 1, and the target resource bit corresponding to the recalled virtual article resource may be determined to be target resource bit 2.

It should be noted that, in the embodiment of the present disclosure, the step 1022b may be executed when the number of target resource bits is not less than 2. In the case that the number of target resource bits is 1, a resource bit operator is not set in the graph to be executed, or the resource bit operator is set to be conditionally not executed, that is, when the condition is satisfied: and under the condition that the number of the target resource bits is 1, the resource bit operator is not executed so as to reduce the number of the operators required to be executed and further improve the operator execution efficiency.

Step 1022c, if the operator to be executed is a sorting operator, running an execution class of the sorting operator based on the sorting information in the operator configuration information, so as to sort the recalled resources corresponding to each target resource bit.

After the resource bit operator is executed, the sorting operator can be used as an operator to be executed. The operator configuration information of the sorting operator may include sorting information, and the sorting information may be used to characterize the feature dimension selected during sorting. Accordingly, the operation parameters of the execution class of the sorting operator may be set based on the sorting information, for example, the execution class of the resource bit operator is run in a code running manner by taking the value of the sorting information as the parameter value of the dimension parameter, so as to obtain the features of the recalled resource in the feature dimension represented by the sorting information, and sorting is performed based on the features. For example, a ranking value is calculated based on the features, and ranking ranks are determined according to the ranking value. The higher the ranking value, the higher the ranking rank can be. It should be noted that the sorting information may also include other information, for example, information characterizing the selected sorting algorithm, which is not limited in this disclosure. The recall operator, the recall algorithm adopted by the sequencing operator and the sequencing algorithm can be set according to actual release requirements.

And 1022d, if the operator to be executed is a release operator, operating the execution class of the release operator within the operation duration defined by the operator configuration information, so as to take the recalled resource with the ranking meeting the preset requirement as the target resource, and release the recalled resource to the target resource position.

In the embodiment of the present disclosure, the operator configuration information may include information required when the operator is executed. The information type specifically included in the operator configuration information may be set according to actual requirements, for example, the operator configuration information of the recall operator, the resource bit operator, and the sorting operator may also include operator operation time lengths, and the operator operation time lengths included in the operator configuration information of different operators may have differences.

The method can operate within the operation time length defined by the configuration information, and if the operation time length is exceeded, the operation can be stopped, and information for representing operator faults is output.

Specifically, the effective operation duration of the execution class of the operator may be set based on the operation duration in the operator configuration information of the operator, for example, a value of the operation duration is used as a parameter value of the effective operation duration parameter, so that when the effective operation duration is exceeded, the fault information is output. When the execution class of the releasing operator is operated in a code operation mode, the recalled resources with the sequencing ranking conforming to the preset requirement can be selected as the target resources, and the target resources are released to the corresponding target resource positions. The ranking rank can be the highest ranking rank, and recalled resources located in the first rank in the ranking result corresponding to the target resource position can be used as target resources to be released.

In the embodiment of the disclosure, the resource delivery of the target resource position can be realized by operating the recall operator, the resource position operator, the sequencing operator and the execution class of the delivery operator in the graph to be executed according to the operator configuration information, and the resource delivery operation can be ensured to be smoothly performed to a certain extent.

It should be noted that the diagram to be executed is not limited to the above operators, and may also include a general BrowseSet reader, a general BrowseSet writer, and a custom operator, for example. The universal browse set reader can be used for reading a resource of a specified type in a resource release process, for example, reading a historical resource browsed by a user. The function realized by the custom operator can be set according to actual requirements, for example, the custom operator can be used for realizing the operation of screening and reading the resources of the specified type in the resource release flow, and the universal browse set write-back operator can be used for realizing the operation of writing the screened resources into the resources recalled by the recall operator in the resource release flow.

Optionally, the configuration information further includes an overall graph configuration, where the overall graph configuration includes an overall execution duration of the graph to be executed and a graph configuration parameter; correspondingly, the embodiment of the present disclosure may further include the following steps:

and B1, outputting error reporting information under the condition that the execution time length of the graph to be executed exceeds the integral execution time length.

And B2, creating a graph execution environment for the graph to be executed based on the graph configuration parameters.

Correspondingly, the executing, according to the graph information of the graph to be executed, the operation of the operator included in the graph to be executed may specifically include: in the graph execution environment, according to the graph information of the graph to be executed, executing an operator included in the graph to be executed.

The graph overall configuration may also be referred to as a graph operation overall configuration. The information included in the overall graph configuration may be according to actual settings, for example, the overall graph configuration may further include graph configuration parameters. Accordingly, in the embodiments of the present disclosure, a graph execution environment may also be created based on the graph configuration parameters. Illustratively, the graph execution environment may be created with the graph configuration parameters as the execution environment parameters. In the graph execution environment, operators included in a graph to be executed are executed according to graph information of the graph to be executed. In this embodiment, the operator included in the graph to be executed is executed according to the graph information of the graph to be executed.

Further, the overall execution duration included in the overall graph configuration may represent the maximum execution duration, and if the execution duration of the graph to be executed exceeds the overall execution duration, it may be determined that there is an abnormality in the current execution process, so that execution may be stopped and error information may be output to remind a maintenance person to handle the abnormality as soon as possible.

In the embodiment of the disclosure, the graph execution environment is created for the graph to be executed based on the graph configuration parameters in the graph overall configuration, smooth execution of the graph to be executed can be ensured to a certain extent, and an error is reported under the condition of timeout based on the overall execution duration in the graph overall configuration, so that the exception can be timely handled.

Optionally, the embodiments of the present disclosure may further include the following steps:

step C1, receiving and storing graph information of a resource-launched directed acyclic DAG graph sent by a creation end; the graph information of the resource delivery DAG graph is sent by the creating end according to a pre-agreed graph protocol.

The graph protocol may be predefined, for example, the graph execution engine may be predefined for the creation end. The graph protocol may specify the type of graph information to be included, and specifically, the graph protocol may specify that the graph information includes the dependency description information and the configuration information. It should be noted that the graph protocol may further specify that the graph information includes a resource injection DAG graph and an operator list of the resource injection DAG graph, where the operator list portion may include operator nodes and operator successor nodes. A resource placement DAG graph refers to a DAG graph for implementing resource placement. Accordingly, the type name (typename) of the operator and the operator successor node (downltream _ processor) may also be included in the graph information. Accordingly, the execution class can be obtained and run based on the type name of the operator. The graph protocol may also provide for the inclusion of a VERSION (VERSION) number in the graph information

In this embodiment of the present disclosure, the graph execution engine may further store the graph to be executed in a specified manner after receiving the resource delivery DAG graph. The designated mode can be an orthogonal list, the orthogonal list mode refers to a chain type storage structure of the directed graph, the orthogonal list can comprise vertex table nodes and edge table nodes, and the vertex table and the edge table are constructed based on the vertex table nodes and the edge table nodes to represent the DAG graph. Specifically, when the graph to be executed is run, the graph to be executed is loaded from the multiple resource delivery DAG graphs and stored in the form of a cross-linked list.

Illustratively, fig. 2 is a schematic process flow diagram provided by an embodiment of the present disclosure, and as shown in fig. 2, after generating a resource injection DAG graph through visualization orchestration, graph information may be sent to a graph execution engine based on a custom graph protocol (DSL). The resource placement DAG graph in the graph is only an example, and two recall operators in the resource placement DAG graph may adopt different recall algorithms. And associating the graph layout with the graph engine execution link based on the custom graph protocol implementation. The graph execution engine can call operators in the operator execution sequence into a thread pool (ThreadPool) in parallel. And the execution thread of each operator calls an operator engine based on the thread pool. Accordingly, the operator engine, in response to the call operation, obtains the execution class corresponding to each operator from the operator loading library. And providing the acquired execution class as a result to an operator for the execution thread to run the execution class of the operator. The thread pool may return the execution results of the operators and ultimately the final execution results of the DAG graph.

The step of obtaining the graph information of the graph to be executed may specifically include: step 1011, obtaining the graph information of the resource delivery DAG graph indicated by the resource delivery request from the stored graph information of the resource delivery DAG graph.

Specifically, the graph information of the resource delivery DAG graph corresponding to the bit identifier carried in the resource delivery request may be obtained from the stored graph information of the resource delivery DAG graph according to the correspondence between the bit identifier and the resource delivery DAG graph, and the graph information may be used as the graph information of the graph to be executed. The corresponding relationship may be the same as the corresponding relationship between the bit identifier and the previously created directed acyclic graph, and the corresponding relationship may be set according to the resource placement positions targeted by the resource placement DAG graph, for example, the resource placement positions targeted by each resource placement DAG graph may be determined, and the corresponding relationship between the bit identifier of the targeted resource placement positions and the resource placement DAG graph may be established. The resource release positions targeted by each resource release DAG graph can be specified by developers, and accordingly, the resource release positions indicated by the specified information can be determined as the resource release positions targeted by the resource release DAG graph according to the received specified information of the resource release DAG graph.

In the embodiment of the disclosure, the graph information of the resource delivery DAG graph indicated by the resource delivery request is acquired from the stored graph information of the resource delivery DAG graph as the graph information of the graph to be executed by receiving and storing the graph information of the resource delivery DAG graph sent by the creation end following the pre-agreed graph protocol. In this way, it is ensured that the transmitted graph information can be identified, and thus the resource injection DAG graph can be smoothly executed.

It should be noted that, in the embodiment of the present disclosure, the crowd type corresponding to the selected to-be-executed graph is matched with the crowd type to which the sender of the resource placement request belongs, the resource placement position corresponding to the to-be-executed graph is matched with the position where the sender is located, and the resource placement time corresponding to the to-be-executed graph is matched with the current time. That is, in the case where these pieces of information match, the graph to be executed is executed in response to the resource placement request. The problem that the sender is interfered by putting resources to the unwanted sender is avoided, and meanwhile, processing resources are saved.

Optionally, the resource delivery DAG graph is obtained by displaying operator options according to preset operators in a preset operator library by the creation end in response to the graph creation operation, and arranging the preset operators indicated by the operator options according to the operator arrangement operation in response to the operator arrangement operation; the preset operators in the preset operator library comprise general operators and custom operators.

Specifically, the operator arrangement may also be referred to as flow arrangement, where the flow arrangement refers to a process of combining operators and aggregating the operators into a DAG graph through links to form an execution link. Wherein the connecting line is the edge. The creating end can be a terminal used by a developer, the creating end can display a front-end interface for the developer, and the developer can perform operator arrangement based on operator options displayed in the front-end interface. The front-end interface may be a graph layout interface. Wherein an operator option may characterize an alternative preset operator. Illustratively, the graph creating operation may be an opening operation of the front-end interface, and the creating end may load, in a case of opening the front-end interface, related information of selectable preset operators from a preset operator library based on the preset operator interface, and generate corresponding operator options. For example, the operator options may include names, functions, and the like of preset operators. The developer can select the operator options displayed in the front-end interface according to the release logic required to be realized. Correspondingly, the creating end can respond to the selection operation, take the preset operator indicated by the operator option selected by each selection operation as a node, create an edge of the node according to the selection sequence, and further generate a resource delivery DAG graph. Therefore, the efficiency of creating the resource release DAG graph can be improved, and developers can conveniently realize the resource release logic.

The selected preset operator can be a general operator or a custom operator. The general operator may be an operator with a use frequency greater than a first preset threshold in the DAG for different resource releases, that is, the general operator may be an operator commonly used in the resource release process. The user-defined operator may be an operator to be used in the DAG map for specific resource placement, and the use frequency of the user-defined operator may be smaller than a second preset threshold, and the second preset threshold may be smaller than the first preset threshold.

Illustratively, fig. 3 is another schematic processing flow provided by the embodiment of the present disclosure, and in this implementation scenario, a preset operator library may be formed based on the codes of the developed generic operators and the custom operators. In the graph arrangement link, business personnel can display operator options in a front-end interface based on operator interfaces so as to carry out visual arrangement, and a DAG graph is generated through online arrangement. For example, development can be completed by dragging required operator options in a front-end interface, a DAG graph is flexibly constructed, and then a resource release strategy is dynamically realized. The DAG graph and its graph information may ultimately be sent to a graph execution engine based on a graph protocol. Therefore, business personnel only need to manage the background to perform graph arrangement, and the resource delivery logic on the business can be realized, so that the realization difficulty is reduced, and the realization efficiency is improved. In the embodiment of the disclosure, visual arrangement is provided, a DAG graph is created in response to arrangement operation of business personnel, a business will be accurately reflected to a certain extent, and changeable business requirements are met.

The resource releasing system can be applied to the resource releasing system, and the resource releasing system enables the user to conveniently obtain the resource through displaying the resource in the resource position of the page, so that the user can conveniently operate the resource. Accordingly, in the embodiments of the present disclosure, the resource delivery system may be further optimized based on the operation performed by the user, for example, the weight of the resource is increased according to the frequency of the operation performed by the user. Accordingly, in the development mode, the common functions in resource delivery can be realized by combining with resource delivery only by a small amount of codes or without the codes, so that the service iteration is realized quickly, and the efficiency is improved. And the front-end architecture and the back-end architecture of the resource delivery system are realized by abstracting the process of the resource delivery scene and arranging low codes based on a small amount of codes and a visual graphical interface, so that business personnel can quickly realize the resource delivery process.

Exemplarily, fig. 4 is a scene schematic diagram provided by the embodiment of the present disclosure, and in a resource delivery scene, a scene algorithm of each delivery scene may be abstracted to generate a common operator set, where the common operator set may include common operators such as a recall operator, a sort operator, a filter operator, a browsing record operator, a set top operator, and a pit-fixing operator. Thus, functions such as a recall function, a sorting function, a filtering function, browsing record acquisition and the like can be realized without encoding. Further, the custom operator is extended by a small amount of code. The custom operator can be expanded in a script mode. That is, the resource delivery logic is completed or extended with less code. And by creating the operator, service capability multiplexing can be provided, and service requirements can be quickly met. The general operator and the custom operator may occupy a corresponding proportion of the preset operator, for example, the proportion occupied by the general operator may be greater than that occupied by the custom operator. And finally, the visual arrangement can be realized in the service scene based on the general operator and the custom operator. Therefore, the ability precipitation can be realized by having an image operator for the resource releasing process, so that business personnel can directly perform arrangement and combination on the graph arrangement page, a resource releasing DAG graph is created, and diversified resource releasing modes are realized.

Fig. 5 is a block diagram illustrating a resource processing apparatus according to an example embodiment, and as shown in fig. 5, the apparatus 50 may include:

an obtaining module 501, configured to respond to a resource release request, obtain graph information of a graph to be executed; the graph to be executed is created based on a preset operator, and the preset operator comprises an operator for realizing resource delivery;

an execution module 502 configured to execute an operator included in the graph to be executed according to the graph information of the graph to be executed, so as to place a target resource in a target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource bit is a resource bit defined by the graph to be executed.

In an optional embodiment, the graph information includes dependency description information and configuration information of an operator in the graph to be executed; the execution module 502 is specifically configured to:

In an alternative embodiment, the configuration information includes operator configuration information; the execution module 502 is further specifically configured to:

In an optional embodiment, the configuration information further includes an overall graph configuration, where the overall graph configuration includes an overall execution duration of the graph to be executed and a graph configuration parameter; the apparatus 50 further comprises:

the execution module 502 is further specifically configured to: in the graph execution environment, according to the graph information of the graph to be executed, executing an operator included in the graph to be executed.

In an alternative embodiment, the apparatus 50 further comprises:

the obtaining module 501 is specifically configured to: and obtaining the graph information of the resource release DAG graph indicated by the resource release request from the stored graph information of the resource release DAG graph.

In an optional embodiment, the resource delivery DAG graph is obtained by the creating end displaying operator options according to preset operators in a preset operator library in response to graph creating operation, and arranging, in response to operator arranging operation, the preset operators indicated by the operator options selected by the operator arranging operation;

To sum up, the resource processing apparatus provided in the embodiment of the present disclosure, in response to a resource release request, obtains graph information of a graph to be executed, where the graph to be executed is created based on a preset operator, and the preset operator includes an operator for implementing resource release. Executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put the target resource into the target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource position is the resource position defined by the graph to be executed. Therefore, the pre-created operator to be executed is executed, so that the resource releasing operation of releasing the target resource to the target resource position can be realized, and the resource releasing can be realized more efficiently.

According to an embodiment of the present disclosure, there is provided an electronic apparatus including: a processor, a memory for storing processor executable instructions, wherein the processor is configured to perform the steps of the resource handling method as in any of the above embodiments when executed.

According to an embodiment of the present disclosure, there is also provided a storage medium, wherein instructions of the storage medium, when executed by a processor of an electronic device, enable the electronic device to perform the steps of the resource processing method as in any one of the above embodiments.

There is also provided, according to an embodiment of the present disclosure, a computer program product including readable program instructions which, when executed by a processor of an electronic device, enable the electronic device to perform the steps of the resource processing method as in any one of the above embodiments.

FIG. 6 is a block diagram illustrating an apparatus for resource processing in accordance with an example embodiment. The apparatus 600 may include, among other things, a processing component 602, a memory 604, a power component 606, a multimedia component 608, an audio component 610, an input/output interface 612, a sensor component 614, a communication component 616, and a processor 620. The processing component 602 may include one or more processors 620 to execute instructions to perform all or a portion of the steps of the resource processing methods described above. In an exemplary embodiment, a storage medium comprising instructions, such as the memory 604 comprising instructions, executable by the processor 620 of the apparatus 600 to perform the method described above is also provided. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

The apparatus 700 may include, among other things, a processing component 722, a memory 732, an input-output interface 758, a network interface 750, and a power component 726. The apparatus 700 may be provided as a server. The application programs stored in memory 732 may include one or more modules that each correspond to a set of instructions. Further, the processing component 722 is configured to execute instructions to perform the resource handling methods described above.

User information (including but not limited to device information of a user, personal information of the user, and the like), related data, and the like, which are referred to in the present disclosure, are information authorized by the user or authorized by various parties.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A method for processing resources, the method comprising:

responding to the resource release request, and acquiring graph information of the graph to be executed; the graph to be executed is created based on a preset operator, and the preset operator comprises an operator for realizing resource delivery;

2. The method according to claim 1, wherein the graph information includes dependency description information and configuration information of operators in the graph to be executed; the executing an operator included in the graph to be executed according to the graph information of the graph to be executed so as to put a target resource into a target resource bit includes:

3. The method of claim 2, wherein the configuration information comprises operator configuration information; the executing the operator to be executed according to the configuration information to release the target resource to the target resource bit includes:

4. The method according to claim 3, wherein the configuration information further includes a graph overall configuration, and the graph overall configuration includes an overall execution duration of the graph to be executed and a graph configuration parameter; the method further comprises the following steps:

5. The method according to any one of claims 1-4, further comprising:

receiving and storing graph information of a resource release directed acyclic DAG graph sent by a creation end; the graph information of the resource delivery DAG graph is sent by the creation end according to a pre-agreed graph protocol;

6. The method according to claim 5, wherein the resource delivery DAG graph is obtained by the creation end responding to graph creation operation, displaying operator options according to preset operators in a preset operator library, responding to operator arrangement operation, and arranging the preset operators indicated by the operator options selected by the operator arrangement operation;

7. An apparatus for resource handling, the apparatus comprising:

the execution module is configured to execute an operator included in the graph to be executed according to the graph information of the graph to be executed so as to release a target resource to a target resource position; the target resource belongs to the resource to be released defined by the graph to be executed, and the target resource bit is a resource bit defined by the graph to be executed.

8. An electronic device, comprising:

a processor;

a memory for storing the processor-executable instructions;

wherein the processor is configured to execute the instructions to implement the method of any one of claims 1 to 6.

9. A storage medium, wherein instructions in the storage medium, when executed by a processor of an electronic device, cause the electronic device to perform the method of any of claims 1-6.

10. A computing device program product comprising readable program instructions which, when executed by a processor of an electronic device, cause the electronic device to perform the method of any of claims 1 to 6.