CN116432954A - Report management scheduling method, system, equipment and storage medium for new energy power plant - Google Patents

Report management scheduling method, system, equipment and storage medium for new energy power plant Download PDF

Info

Publication number
CN116432954A
CN116432954A CN202310321666.6A CN202310321666A CN116432954A CN 116432954 A CN116432954 A CN 116432954A CN 202310321666 A CN202310321666 A CN 202310321666A CN 116432954 A CN116432954 A CN 116432954A
Authority
CN
China
Prior art keywords
task
nodes
subgraph
new energy
energy power
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.)
Pending
Application number
CN202310321666.6A
Other languages
Chinese (zh)
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.)
BEIJING YUENENG TECHNOLOGY CO LTD
Original Assignee
BEIJING YUENENG 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 BEIJING YUENENG TECHNOLOGY CO LTD filed Critical BEIJING YUENENG TECHNOLOGY CO LTD
Priority to CN202310321666.6A priority Critical patent/CN116432954A/en
Publication of CN116432954A publication Critical patent/CN116432954A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computing arrangements based on specific mathematical models
    • G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Energy or water supply
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S10/00—Systems supporting electrical power generation, transmission or distribution
    • Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Educational Administration (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Health & Medical Sciences (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Probability & Statistics with Applications (AREA)
  • Algebra (AREA)
  • Artificial Intelligence (AREA)
  • Computational Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a report management scheduling method, system, equipment and storage medium for a new energy power plant, wherein the method comprises the following steps: generating a task configuration table based on the task information; according to the Task configuration table, encapsulating the Task into a Task instance; taking the Task instance as a node to generate a directed acyclic graph; splitting the directed acyclic graph into subgraphs based on the dependency relationships between the nodes; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship; generating topological ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph; and executing tasks according to the directed acyclic graph. By the processing scheme, configuration difficulty is reduced, and calculation accuracy and report calculation efficiency are improved.

Description

Report management scheduling method, system, equipment and storage medium for new energy power plant
Technical Field
The invention relates to the technical field of data processing, in particular to a report management scheduling method, system, equipment and storage medium for a new energy power plant.
Background
The new energy power generation project has complex service scene, strict production management, huge index system and strong logic. The calculation tasks of the report form are divided into two types, namely a simple calculation task and a complex timing task, wherein the simple calculation task can be triggered to be executed only at fixed time, but the complex timing task has a dependency relationship, and the execution condition of one task must be that the front-end task of the task has been executed successfully. Most report tasks of new energy power generation projects are complex timing tasks, a certain task of report calculation production refers to calculation of a group of indexes in a report, but because the group of indexes possibly have dependency relations with indexes of other tasks, the dependency relations exist among the tasks, and therefore, the execution sequence of the tasks needs to be reasonably arranged.
At present, the management mode of the new energy power generation project report calculation task is to manually set the execution time of each task or manually order the tasks to be executed in sequence. However, for the complex dependency relationship between tasks, it is difficult to comb and clear, and the error rate of manually configuring the execution sequence is high, so that the efficiency of manually setting the time operation mode of the tasks is low.
Therefore, the above-mentioned existing report management method is still inconvenient and disadvantageous, and needs to be further improved. How to create a new report management method becomes the aim of improvement in the current industry.
Disclosure of Invention
In view of the above, embodiments of the present disclosure provide a report management scheduling method for a new energy power plant, which at least partially solves the problems existing in the prior art.
In a first aspect, an embodiment of the present disclosure provides a report management scheduling method for a new energy power plant, where the method includes the following steps:
generating a task configuration table based on the task information;
according to the Task configuration table, encapsulating the Task into a Task instance;
taking the Task instance as a node to generate a directed acyclic graph;
splitting the directed acyclic graph into subgraphs based on the dependency relationships between the nodes; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship;
generating topological ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph;
and executing tasks according to the directed acyclic graph.
According to a specific implementation of an embodiment of the disclosure, the method further includes: the tasks within each sub-graph are executed in parallel.
According to a specific implementation manner of the embodiment of the disclosure, the task information includes a task name, a data source, a result storage location, a method name of a calling program and a dependency relationship between tasks.
The Task instance includes: task name, data source library, result repository, program method name.
According to a specific implementation of an embodiment of the disclosure, the method further includes:
when the task execution is completed, marking the task as an execution completion state;
before the task runs, checking whether all the marks of the dependent tasks are in a finished state, and if so, executing the task.
According to a specific implementation manner of the embodiment of the disclosure, the Task instance further includes a Task execution method.
According to a specific implementation manner of the embodiment of the present disclosure, the generating a topological order according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph includes:
arranging the dependent nodes of any node in the subgraph in front of the dependent nodes to obtain topological ordering of the subgraph;
packaging all Task instances in the subgraph into SuperTask instances; wherein, the SuperTask instance comprises a ordered Task instance list.
In a second aspect, an embodiment of the present disclosure provides a report management scheduling system for a new energy power plant, where the system includes:
a task configuration module configured to generate a task configuration table based on the task information;
the Task packaging module is configured to package the Task into a Task instance according to the Task configuration table;
the Task merging module is configured to take the Task instance as a node to generate a directed acyclic graph; splitting the directed acyclic graph into subgraphs based on the dependency relationships between the nodes; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship; generating topological ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph;
and the task execution module is configured to execute tasks according to the directed acyclic graph.
According to a specific implementation of an embodiment of the disclosure, the system further includes:
the ordering module is configured to arrange the dependent node of any node in the subgraph in front of the dependent node to obtain the topological ordering of the subgraph; packaging all Task instances in the subgraph into a SuperTask instance; wherein, the SuperTask instance comprises a ordered Task instance list.
In a third aspect, embodiments of the present disclosure further provide an electronic device, including:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor, which when executed by the at least one processor, cause the at least one processor to implement the new energy power plant report management scheduling method of the first aspect or any implementation manner of the first aspect.
In a fourth aspect, the presently disclosed embodiments also provide a non-transitory computer-readable storage medium storing computer instructions that, when executed by at least one processor, cause the at least one processor to perform the new energy power plant report management scheduling method of the foregoing first aspect or any implementation of the first aspect.
In a fifth aspect, embodiments of the present disclosure also provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the new energy power plant report management scheduling method of the first aspect or any implementation manner of the first aspect.
The report management scheduling method for the new energy power plant solves the problem that when the report calculation task management of the new energy power generation project is performed at present, the execution time of each task is required to be manually set, or the tasks are manually ordered and sequentially executed, so that the time waste is caused. And the tasks after encapsulation and merging can be started to be executed in parallel by multiple processes, so that the report calculation efficiency is improved.
Drawings
The foregoing is merely an overview of the present invention, and the present invention is further described in detail below with reference to the accompanying drawings and detailed description.
Fig. 1 is a schematic flow chart of a report management scheduling method for a new energy power plant according to an embodiment of the disclosure;
FIG. 2 is a schematic diagram of a splitting process of a directed acyclic graph and a sub-graph generated according to a task configuration table according to an embodiment of the disclosure;
fig. 3 is a schematic structural diagram of a report management scheduling system of a new energy power plant according to an embodiment of the present disclosure; and
fig. 4 is a schematic diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
Embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
Other advantages and effects of the present disclosure will become readily apparent to those skilled in the art from the following disclosure, which describes embodiments of the present disclosure by way of specific examples. It will be apparent that the described embodiments are merely some, but not all embodiments of the present disclosure. The disclosure may be embodied or practiced in other different specific embodiments, and details within the subject specification may be modified or changed from various points of view and applications without departing from the spirit of the disclosure. It should be noted that the following embodiments and features in the embodiments may be combined with each other without conflict. All other embodiments, which can be made by one of ordinary skill in the art without inventive effort, based on the embodiments in this disclosure are intended to be within the scope of this disclosure.
It is noted that various aspects of the embodiments are described below within the scope of the following claims. It should be apparent that the aspects described herein may be embodied in a wide variety of forms and that any specific structure and/or function described herein is merely illustrative. Based on the present disclosure, one skilled in the art will appreciate that one aspect described herein may be implemented independently of any other aspect, and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented and/or a method practiced using any number of the aspects set forth herein. In addition, such apparatus may be implemented and/or such methods practiced using other structure and/or functionality in addition to one or more of the aspects set forth herein.
In addition, in the following description, specific details are provided in order to provide a thorough understanding of the examples. However, it will be understood by those skilled in the art that the aspects may be practiced without these specific details.
At present, the directed acyclic graph is applied to the fields of starting an electronic equipment system, machine learning infrastructure and the like for managing tasks. The invention applies the directed acyclic graph to task management to report calculation task scheduling management of new energy power generation projects for the first time, realizes task management automation, improves execution efficiency, and avoids index calculation errors caused by execution sequence errors.
The implementation process for managing and scheduling the execution of the new energy power plant production report calculation task by the directed acyclic graph provided by the invention comprises the following steps: configuration task-packaging task-merging task-executing task.
Fig. 1 is a schematic diagram of a new energy power plant report management scheduling method according to an embodiment of the disclosure.
As shown in fig. 1, at step S110, a task configuration table is generated based on the task information.
In the embodiment of the invention, the task information comprises a task name, a data source, a result storage position, a method name of a calling program and a dependency relationship among tasks.
More specifically, the configuration task is to configure the basic information of the task into a table, which includes the name of the task, the data source, the result storage location, the method name of the calling program, and which task the execution of the present task depends on, and the table format is shown in table 1.
TABLE 1 task configuration form
Figure BDA0004151961730000061
Figure BDA0004151961730000071
More specifically, step S120 is next followed.
At step S120, the Task is encapsulated into a Task instance according to the Task configuration table.
In an embodiment of the present invention, the Task instance includes: task name, data source library, result repository, program method name.
In the embodiment of the invention, the Task instance further comprises a Task executing method.
More specifically, a class is first defined in the new energy farm report calculation program for encapsulating the attributes and methods of the calculation Task, for example, such class is named as Task class. The Task class has the following attributes: task name (taskName), data source library (dataSource), results repository (writeTo), program method name (function); the Task class includes a start () method for executing the Task calculation report pointer.
Each Task can be packaged into a Task instance according to the information of the Task configuration table.
Next, the process goes to step S130.
At step S130, a directed acyclic graph is generated using the Task instance as a node.
More specifically, taking the Task instance generated in step S120 as a node, an upstream node of a certain node is a dependent Task of the Task, and a connection between two nodes is called an edge. For example, taskB relies on taskA execution completion, then the edge between these two nodes is pointed to by taskA to taskB. The directed acyclic graph formed by all Task instances and dependencies is called a total graph.
Next, the process goes to step S140.
Splitting the directed acyclic graph into subgraphs based on the dependencies between the nodes at step S140; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship.
More specifically, in the overall graph, a certain group of nodes are connected by edges, but are not connected with other nodes, the graph formed by the group of nodes is called a sub graph, the overall graph is split into a plurality of sub graphs which are not connected with each other, and obviously, the tasks in the sub graphs have a dependency relationship, and the tasks in the different sub graphs do not have a dependency relationship.
The splitting process of the total graph and the sub graph generated according to the task configuration table is shown in fig. 2.
Next, the process goes to step S150.
At step S150, a topological order is generated according to the dependency relationship of the nodes in the subgraph, and the ordered nodes in the subgraph are merged and packaged.
In the embodiment of the present invention, the generating topology ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph includes:
arranging the dependent nodes of any node in the subgraph in front of the dependent nodes to obtain topological ordering of the subgraph;
packaging all Task instances in the subgraph into SuperTask instances; wherein, the SuperTask instance comprises a ordered Task instance list.
Defining a superstate class in the program, wherein the superstate class has the following properties: ordered lists of Task instances (taskList), such methods have a start () method for performing this Task to calculate the report metrics.
More specifically, the topological order is obtained from sub-graph to sub-graph, and the topological order refers to that all nodes in the graph are arranged into a linear sequence, so that the dependent node of any node in the graph is arranged in front of the dependent node. And packaging all Task instances of the sub-graph into a SuperTask instance, wherein the Task list attribute of the SuperTask instance is equal to the ordered Task instance list.
As shown in fig. 2, the topological ordering of each sub-graph is:
sub-graph 1: task A
Sub-graph 2: task B-task C-task D
Sub-graph 3: task E-task F-task I-task G-task J-task H-task K
Sub-graph 4: task L-task M-task P-task N-task O
Subgraph 5: task Q-task T-task R-task S-task U
The results of task merging are as follows:
sub-picture 1 does not need to incorporate encapsulation, but is still taskA.
Sub-graph 2 is merged and encapsulated into a superTask instance, named task2.
Sub-graph 3 is merged and encapsulated into a superTask instance, named task3.
Sub-graph 4 is merged and encapsulated into a superTask instance, named task4.
Sub-graph 5 is merged and encapsulated into a superTask instance, named task5.
Next, the process goes to step S160.
At step S160, a task is performed according to the directed acyclic graph.
In an embodiment of the present invention, the method further includes: the tasks within each sub-graph are executed in parallel.
More specifically, the task instances after being encapsulated can be executed in parallel without dependency relationship, and the start () method of the task instance is called when the task instances are executed.
For example, the above encapsulated task a, task2, task3, task4, task5 have no dependency relationship, and may be parallel, so that the start () method of the multiple processes may be started to call them for execution in parallel, thereby improving the computing efficiency.
In an embodiment of the present invention, the method further includes: the completion status is marked when a task is completed and the status of all its dependent tasks is checked before the task is executed. More specifically, the dependent task of each task is configured, and when each task execution is completed, it is marked as an execution completion state. Before each task runs, checking whether all the marks of the dependent tasks are in a finished state, and executing the task if the marks are met.
In embodiments of the present invention, the present invention may be implemented using a variety of object-oriented programming languages, such as Python, java, C ++, etc., and the present invention is not limited thereto.
The report management scheduling method for the new energy power plant solves the problem that when the report calculation task management of the new energy power generation project is performed at present, the execution time of each task is required to be manually set, or the tasks are manually ordered and sequentially executed, so that the time waste is caused. And the tasks after encapsulation and merging can be started to be executed in parallel by multiple processes, so that the report calculation efficiency is improved.
Fig. 3 shows a report management scheduling system 300 of a new energy power plant provided by the invention, which comprises a task configuration module 310, a task encapsulation module 320, a task merging module 330 and a task execution module 340.
The task configuration module 310 is configured to generate a task configuration table based on the task information;
the Task packaging module 320 is configured to package the Task into a Task instance according to the Task configuration table;
the Task merging module 330 is configured to generate a directed acyclic graph by using the Task instance as a node; splitting the directed acyclic graph into subgraphs based on the dependency relationships between the nodes; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship; generating topological ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph;
the task execution module 340 is configured to execute tasks according to the directed acyclic graph.
In an embodiment of the present invention, the system further includes:
the ordering module is configured to arrange the dependent node of any node in the subgraph in front of the dependent node to obtain the topological ordering of the subgraph; packaging all Task instances in the subgraph into a SuperTask instance; wherein, the SuperTask instance comprises a ordered Task instance list.
Referring to fig. 4, the disclosed embodiment also provides an electronic device 40, comprising:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the new energy power plant report management scheduling method of the foregoing method embodiments.
The disclosed embodiments also provide a non-transitory computer readable storage medium storing computer instructions for causing the computer to execute the new energy power plant report management scheduling method in the foregoing method embodiments.
The disclosed embodiments also provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the new energy power plant report management scheduling method in the foregoing method embodiments.
Referring now to fig. 4, a schematic diagram of an electronic device 40 suitable for use in implementing embodiments of the present disclosure is shown. The electronic devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 4 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.
As shown in fig. 4, the electronic device 40 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 401, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage means 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the electronic device 40 are also stored. The processing device 401, the ROM 402, and the RAM 403 are connected to each other by a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
In general, the following devices may be connected to the I/O interface 405: input devices 406 including, for example, a touch screen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; an output device 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 408 including, for example, magnetic tape, hard disk, etc.; and a communication device 409. The communication means 409 may allow the electronic device 40 to communicate with other devices wirelessly or by wire to exchange data. While an electronic device 40 having various means is shown in the figures, it should be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via communications device 409, or from storage 408, or from ROM 402. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by the processing device 401.
It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer 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 computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring at least two internet protocol addresses; sending a node evaluation request comprising the at least two internet protocol addresses to node evaluation equipment, wherein the node evaluation equipment selects an internet protocol address from the at least two internet protocol addresses and returns the internet protocol address; receiving an Internet protocol address returned by the node evaluation equipment; wherein the acquired internet protocol address indicates an edge node in the content distribution network.
Alternatively, the computer-readable medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: receiving a node evaluation request comprising at least two internet protocol addresses; selecting an internet protocol address from the at least two internet protocol addresses; returning the selected internet protocol address; wherein the received internet protocol address indicates an edge node in the content distribution network.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The name of the unit does not in any way constitute a limitation of the unit itself, for example the first acquisition unit may also be described as "unit acquiring at least two internet protocol addresses".
It should be understood that portions of the present disclosure may be implemented in hardware, software, firmware, or a combination thereof.
The foregoing is merely specific embodiments of the disclosure, but the protection scope of the disclosure is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the disclosure are intended to be covered by the protection scope of the disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.

Claims (10)

1. The report management scheduling method for the new energy power plant is used for managing and scheduling production report calculation tasks and is characterized by comprising the following steps of:
generating a task configuration table based on the task information;
according to the Task configuration table, encapsulating the Task into a Task instance;
taking the Task instance as a node to generate a directed acyclic graph;
splitting the directed acyclic graph into subgraphs based on the dependency relationships between the nodes; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship;
generating topological ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph;
and executing tasks according to the directed acyclic graph.
2. The new energy power plant report management scheduling method of claim 1, further comprising: the tasks within each sub-graph are executed in parallel.
3. The report management scheduling method of a new energy power plant according to claim 1, wherein the task information includes task names, data sources, result storage locations, method names of calling programs and dependency relations among tasks;
the Task instance includes: task name, data source library, result repository, program method name.
4. The new energy power plant report management scheduling method of claim 1, further comprising:
when the task execution is completed, marking the task as an execution completion state;
before the task runs, checking whether all the marks of the dependent tasks are in a finished state, and if so, executing the task.
5. The new energy power plant report management scheduling method of claim 4, wherein the Task instance further comprises a method for executing tasks.
6. The report management scheduling method of a new energy power plant according to any one of claims 1 to 5, wherein the generating a topological order according to the dependency relationship of the nodes in the subgraph, and merging and packaging the nodes in the ordered subgraph, includes:
arranging the dependent nodes of any node in the subgraph in front of the dependent nodes to obtain topological ordering of the subgraph;
packaging all Task instances in the subgraph into SuperTask instances; wherein, the SuperTask instance comprises a ordered Task instance list.
7. A new energy power plant report management scheduling system, the system comprising:
a task configuration module configured to generate a task configuration table based on the task information;
the Task packaging module is configured to package the Task into a Task instance according to the Task configuration table;
the Task merging module is configured to take the Task instance as a node to generate a directed acyclic graph; splitting the directed acyclic graph into subgraphs based on the dependency relationships between the nodes; wherein, the nodes in the subgraphs have a dependency relationship, and the nodes in different subgraphs have no dependency relationship; generating topological ordering according to the dependency relationship of the nodes in the subgraph, and merging and packaging the ordered nodes in the subgraph;
and the task execution module is configured to execute tasks according to the directed acyclic graph.
8. The new energy power plant report management scheduling system of claim 7, wherein the system further comprises:
the ordering module is configured to arrange the dependent node of any node in the subgraph in front of the dependent node to obtain the topological ordering of the subgraph; packaging all Task instances in the subgraph into a SuperTask instance; wherein, the SuperTask instance comprises a ordered Task instance list.
9. An electronic device, comprising:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor, which when executed by the at least one processor, cause the at least one processor to perform the new energy power plant report management scheduling method of any one of claims 1 to 6.
10. A non-transitory computer readable storage medium storing computer instructions that, when executed by at least one processor, cause the at least one processor to perform the new energy power plant report management scheduling method of any one of claims 1 to 6.
CN202310321666.6A 2023-03-29 2023-03-29 Report management scheduling method, system, equipment and storage medium for new energy power plant Pending CN116432954A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310321666.6A CN116432954A (en) 2023-03-29 2023-03-29 Report management scheduling method, system, equipment and storage medium for new energy power plant

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310321666.6A CN116432954A (en) 2023-03-29 2023-03-29 Report management scheduling method, system, equipment and storage medium for new energy power plant

Publications (1)

Publication Number Publication Date
CN116432954A true CN116432954A (en) 2023-07-14

Family

ID=87090017

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310321666.6A Pending CN116432954A (en) 2023-03-29 2023-03-29 Report management scheduling method, system, equipment and storage medium for new energy power plant

Country Status (1)

Country Link
CN (1) CN116432954A (en)

Similar Documents

Publication Publication Date Title
CN111475298B (en) Task processing method, device, equipment and storage medium
CN109523187B (en) Task scheduling method, device and equipment
CN111367516B (en) Application interface generation method and device and electronic equipment
CN112395253B (en) Index file generation method, terminal device, electronic device and medium
CN111796865B (en) Byte code file modification method, device, terminal equipment and medium
CN112214408B (en) Dependency conflict detection method, dependency conflict detection device, electronic equipment and computer readable medium
CN110960855B (en) Communication protocol code updating method and device, electronic equipment and storage medium
CN111309304B (en) Method, device, medium and electronic equipment for generating IDL file
CN111338944B (en) Remote Procedure Call (RPC) interface testing method, device, medium and equipment
CN111857720B (en) User interface state information generation method and device, electronic equipment and medium
CN111950857A (en) Index system management method and device based on service indexes and electronic equipment
CN113220281A (en) Information generation method and device, terminal equipment and storage medium
CN110704050B (en) Module initializing method and device, electronic equipment and computer readable storage medium
CN111414152B (en) Method, system, readable medium and electronic device for realizing business logic
CN111324258B (en) Method, device, equipment and medium for generating contents of configuration items of multilevel pull-down menu
CN110888773B (en) Method, device, medium and electronic equipment for acquiring thread identification
CN110515909B (en) File storage method and device, electronic equipment and computer storage medium
CN111625326B (en) Task pipeline execution method and device and electronic equipment
CN111399902B (en) Client source file processing method and device, readable medium and electronic equipment
CN116432954A (en) Report management scheduling method, system, equipment and storage medium for new energy power plant
CN111737040B (en) Program code repairing method and device
CN111414161B (en) Method, device, medium and electronic equipment for generating IDL file
CN111240657A (en) Method and device for generating SDK and electronic equipment
CN110908867B (en) Task completion judging method and device, storage medium and electronic equipment
CN112688863B (en) Gateway data processing method and device and electronic equipment

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