A drainage network parallel computing method, device, electronic equipment and storage medium

By decomposing the pipeline and inspection well status variables of the drainage pipeline network into multiple units and performing parallel calculations, the complexity and efficiency of the conserved water volume calculation in the urban drainage pipeline network is solved, and efficient and accurate water flow simulation is achieved.

CN117972271BActive Publication Date: 2024-11-26GUANGDONG RES INST OF WATER RESOURCES & HYDROPOWER
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410156878.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-02-04
Publication Date
2024-11-26
Estimated Expiration
2044-02-04

AI Technical Summary

Technical Problem

The existing technology is difficult to accurately calculate the conserved water volume of urban drainage pipelines, especially in the case of short-term heavy precipitation. The complexity of the water flow state in the pipeline leads to difficulty in numerical simulation, and the existing parallel computing technology is insufficiently applied.

Method used

A parallel calculation method for drainage pipeline network is proposed. By obtaining the state variables of the pipeline and the inspection well, the pipeline is decomposed into multiple pipe segment units, and the state variables are mapped into an array, and the mass and momentum flux of the water flow are calculated in parallel based on the array. Use mass, energy conservation and Riemann invariants to solve water depth and flux to achieve conservation calculations.

Benefits of technology

It improves calculation efficiency and accuracy, can calculate the water flow in parallel in the GPU, and provides accurate simulation values ​​of drainage pipe networks, solving the problems of inconservation of water volume and low computational efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117972271B_ABST
    Figure CN117972271B_ABST
Patent Text Reader

Abstract

The present application discloses a method, device, electronic device and storage medium for parallel calculation of drainage pipe network, the method comprising: obtaining the state variables of each pipe and each inspection well in the drainage pipe network; each pipe is decomposed into multiple pipe section units by multiple interfaces; mapping the state variables of the pipe section units on the left side of each interface and the state variables of each inspection well to the first array, mapping the state variables of the pipe section units on the right side of each interface and the state variables of each inspection well to the second array; parallel calculation of the numerical flux of the internal interface based on the first and second arrays; solving the water depth of the inspection well and the numerical flux of the pipe interface at the next moment according to the conservation of mass, energy and Riemann invariant; performing conservation calculation on the numerical flux corresponding to the left and right interfaces of each pipe section unit in parallel, and obtaining the state variables of the pipe section unit at the next moment. The present application can efficiently and accurately calculate the conserved water volume of the drainage pipe network, and can be widely used in the field of water conservancy engineering technology.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of water conservancy engineering, and in particular to a method, device, electronic equipment and storage medium for parallel computing of a drainage network. Background Art

[0002] The urban drainage system is the most important engineering measure to remove surface waterlogging and alleviate urban flood disasters. Under normal circumstances, surface waterlogging is discharged into the drainage network through the rainwater inlet. When the short-term heavy rainfall exceeds the flow capacity of the drainage system, the pipe flow may flow back to the surface through the rainwater inlet and rainwater inspection well. The flow pattern of water in the urban drainage network is highly complex, with multiple flow patterns such as open channel flow and pressurized flow, rapid flow and slow flow, which brings certain difficulties to numerical simulation. Summary of the invention

[0003] The main purpose of the embodiments of the present application is to propose a parallel calculation method, device, electronic device and storage medium for a drainage network, so as to efficiently and accurately calculate the conserved water volume of the drainage network.

[0004] To achieve the above purpose, one aspect of an embodiment of the present application provides a drainage network parallel computing method, the method comprising:

[0005] Obtaining the state variables of each pipeline and each inspection well in the drainage network; wherein each of the pipelines is decomposed into a plurality of pipe segment units by a plurality of interfaces;

[0006] Mapping the state variables corresponding to the pipe section units on the left side of each interface and the state variables of each inspection well into a first array, and mapping the state variables corresponding to the pipe section units on the right side of each interface and the state variables of each inspection well into a second array;

[0007] Calculating the numerical flux of each interface in parallel based on the first array and the second array at a preset time step; the numerical flux includes the mass flux and momentum flux of the water flow passing through the interface;

[0008] According to the conservation of mass, energy and Riemann invariants, the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface are solved;

[0009] The numerical fluxes corresponding to the interfaces on the left and right sides of each pipe segment unit are subjected to conservation calculation in parallel to obtain the state variables of each pipe segment unit at the next moment.

[0010] In some embodiments, the parallel calculation of the numerical flux of each of the interfaces based on the first array and the second array includes:

[0011] Determine that the control equation of water flow movement in each of the pipes is a one-dimensional pipe flow equation;

[0012] When the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water-passing section of each of the pipes; when the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes;

[0013] The one-dimensional pipe flow equation is solved according to the pressure term to obtain the numerical flux of each interface.

[0014] In some embodiments, the control equation for determining the water flow movement in each of the pipes is a one-dimensional pipe flow equation, including:

[0015] The one-dimensional pipe flow equation is determined as:

[0016]

[0017] in, A is the water flow cross-sectional area of ​​each of the pipes; Q is the flow rate of each of the pipes; I is the pressure term; P is the wetted perimeter; C D is the dimensionless friction parameter, R h =A / P, R h is the hydraulic radius; g is the acceleration due to gravity.

[0018] In some embodiments, when the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water flow section of each of the pipes, including:

[0019] Calculate the pressure term in the one-dimensional pipe flow equation according to a first calculation formula;

[0020] The first calculation formula is:

[0021]

[0022] Wherein, θ is the water flow section angle of each of the pipes;

[0023] When the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes, including:

[0024] Calculate the pressure term in the one-dimensional pipe flow equation according to a second calculation formula;

[0025] The second calculation formula is:

[0026]

[0027] Wherein, d is the diameter of each of the pipes, H is the pressure head, and H is calculated by the third calculation formula;

[0028] The third calculation formula is:

[0029]

[0030] Where a is the pressure wave velocity; A P is the cross-sectional area of ​​each of the pipes.

[0031] In some embodiments, solving the one-dimensional pipe flow equation according to the pressure term to obtain the numerical flux of each interface includes:

[0032] Discretizing the one-dimensional pipe flow equation according to the Godunov format finite volume method to obtain a target control equation;

[0033] Solving the target control equation using an approximate Riemann solution at the preset time step to obtain a numerical flux of each interface;

[0034] The target control equation is:

[0035]

[0036] Wherein, n and n+1 are time steps, Δt is the preset time step, and Δx is the preset space step;

[0037] The numerical flux of each of the interfaces is:

[0038] F i+12 =F HLL (h L ,h R ,H L ,H R ,Q L ,Q R );

[0039] in,

[0040] The time step is:

[0041]

[0042] Among them, C r is the Courant number, with a value range of (0,1]; V 1d is the average water flow velocity of each of the pipe sections.

[0043] In some embodiments, solving the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface according to the mass, energy conservation and Riemann invariant includes:

[0044] According to the state variables of each pipe section unit and each inspection well, the water depth of each inspection well at the next time step and the numerical flux corresponding to each pipeline connected to each inspection well are solved based on the mass conservation equation, the energy conservation equation and the Riemann invariant;

[0045] Under open channel flow conditions, the inflow energy conservation equation for each of the pipelines connected to each of the inspection wells is determined as follows:

[0046]

[0047] Under open channel flow conditions, the outflow energy conservation equation of each of the pipelines connected to each of the inspection wells is determined as:

[0048]

[0049] in, is the boundary water depth of the pipeline, is the critical water depth, h is the water depth of the edge pipe section unit of the pipeline; j is the water depth in the inspection well; d rj To connect the height difference between the bottom of the pipeline and the bottom of the inspection well;

[0050] The mass conservation equation is:

[0051]

[0052] Wherein, the superscripts n and n+1 are time steps; Q d is the water flow into the inspection well; Q o A is the water flowing out of the inspection well; d is the area of ​​the inspection well; d is the water depth in the inspection well;

[0053] The Riemann invariants include the pressurized flow condition and the open channel flow condition:

[0054] The pressurized flow conditions are:

[0055]

[0056] The open channel flow conditions are:

[0057] du±(c / A)dA=0;

[0058] Among them, the + sign corresponds to the inlet pipe, the - sign corresponds to the outlet pipe, u is the flow velocity; and c is the wave velocity.

[0059] In some embodiments, the method further comprises:

[0060] Calculating the water flow from the surface into the inspection well according to the fourth calculation formula and calculating the water flow from the inspection well out of the surface according to the fifth calculation formula include:

[0061] The fourth calculation formula is:

[0062]

[0063] Among them, Q d H is the water flow into the inspection well; s is the height difference between the surface water level and the bottom of the inspection well, H s =h s +d j ;h j is the water depth in the inspection well; d rj The height difference between the bottom of the pipeline and the bottom of the inspection well; d j is the height of the inspection well;

[0064] The fifth calculation formula is:

[0065]

[0066] Among them, Q o A is the water flowing out of the inspection well; j is the cross-sectional area of ​​the inspection well.

[0067] To achieve the above-mentioned purpose, another aspect of the embodiment of the present application provides a drainage network parallel computing device, the device comprising:

[0068] A state variable acquisition unit is used to acquire the state variables of each pipeline in the drainage network and the state variables of each inspection well; wherein each of the pipelines is decomposed into a plurality of pipe section units by a plurality of interfaces;

[0069] A state variable mapping unit, used to map the state variables corresponding to the pipe section units on the left side of each interface and the state variables of each inspection well into a first array, and map the state variables corresponding to the pipe section units on the right side of each interface and the state variables of each inspection well into a second array;

[0070] A numerical flux calculation unit, configured to calculate the numerical flux of each of the interfaces in parallel based on the first array and the second array at a preset time step; the numerical flux includes a mass flux and a momentum flux of the water flow passing through the interface;

[0071] A water flow variation determination unit, used to solve the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface according to mass, energy conservation and Riemann invariant;

[0072] The conservation calculation determination unit is used to perform conservation calculations on the numerical fluxes corresponding to the interfaces on the left and right sides of each of the pipe section units in parallel to obtain the state variables of each of the pipe section units at the next moment.

[0073] To achieve the above objective, another aspect of an embodiment of the present application provides an electronic device, the electronic device comprising a memory and a processor, the memory storing a computer program, and the processor implementing the above method when executing the computer program.

[0074] To achieve the above objective, another aspect of an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program implements the above method when executed by a processor.

[0075] The embodiments of the present application include at least the following beneficial effects:

[0076] The present application obtains the state variables of each pipeline and each inspection well in the drainage network; wherein each pipeline is decomposed into multiple pipe segment units by multiple interfaces; the state variables corresponding to the pipe segment units on the left side of each interface and the state variables of each inspection well are mapped to the first array, and the state variables corresponding to the pipe segment units on the right side of each interface and the state variables of each inspection well are mapped to the second array; the numerical flux of each interface is calculated in parallel based on the first array and the second array at a preset time step; the numerical flux includes the mass flux and momentum flux of the water flow through the interface; according to the conservation of mass, energy and Riemann invariants, the water depth of each inspection well and the numerical flux of the interface corresponding to each pipeline connected to each inspection well are solved; the numerical flux corresponding to the interface on the left and right sides of each pipe segment unit is conserved in parallel to obtain the state variables of each pipe segment unit at the next moment. The present application decomposes each pipeline into multiple pipe segment units according to multiple interfaces, and then the numerical flux of each interface can be calculated in parallel in the GPU, which improves the calculation efficiency, and the segmented calculation is more accurate than the overall calculation, which can provide accurate simulation values ​​for the drainage network. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] Figure 1 A schematic diagram of a flow chart of a drainage network parallel calculation method provided in an embodiment of the present application;

[0078] Figure 2 An exemplary structural diagram of a drainage network provided in an embodiment of the present application;

[0079] Figure 3 An example diagram of a global array data storage structure provided in an embodiment of the present application;

[0080] Figure 4 An example diagram of the division of a pipeline provided in an embodiment of the present application;

[0081] Figure 5 An example diagram of a mapping method of a state variable provided in an embodiment of the present application;

[0082] Figure 6 An example diagram of another mapping method of state variables provided in an embodiment of the present application;

[0083] Figure 7 An array mapping relationship diagram of an interface and a pipe segment provided in an embodiment of the present application;

[0084] Figure 8 An array mapping relationship diagram of a pipe segment and an interface provided in an embodiment of the present application;

[0085] Fig. 9 A code example diagram of a copy array instruction provided in an embodiment of the present application;

[0086] Fig.10 A code example diagram of a parallel computing example provided in an embodiment of the present application;

[0087] Fig.11 A schematic diagram of a TPA method provided in an embodiment of the present application;

[0088] Fig.12 A schematic diagram of a connection between a pipeline and an inspection well provided in an embodiment of the present application;

[0089] Fig.13 An example flow chart of a drainage network parallel computing method provided in an embodiment of the present application;

[0090] Fig.14 A schematic diagram of the structure of a parallel computing device for a drainage network provided in an embodiment of the present application;

[0091] Fig.15 A schematic diagram of the hardware structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0092] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is further described in detail below in conjunction with the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the embodiments of the present application. They are only examples of devices and methods consistent with some aspects of the embodiments of the present application as detailed in the attached claims.

[0093] It is understood that the terms "first", "second", etc. used in this application can be used to describe various concepts in this article, but unless otherwise specified, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another concept. For example, without departing from the scope of the embodiment of the present application, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the words "if" and "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determination".

[0094] The terms "at least one", "multiple", "each", "any", etc. used in this application, at least one includes one, two or more, multiple includes two or more, each refers to each of the corresponding multiple, and any refers to any one of the multiple.

[0095] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0096] Before describing the embodiments of the present application in detail, some related technologies involved in the embodiments of the present application are first described as follows:

[0097] In order to solve the problem of hydrodynamic simulation of urban underground drainage pipe networks, relevant technologies have developed some pipe network models represented by the SWMM model (StormWater Management Model). The SWMM model uses the "node-segment" assumption and takes a drainage pipe and the connected rainwater inspection well as the basic unit of calculation.

[0098] The advantage of the "segment-node" generalization method is that it has high computational efficiency, but it cannot reflect the detailed flood evolution process in the pipeline. This generalization method is based on the finite difference method for solution, which has poor conservation properties and often results in water volume non-conservation problems.

[0099] In order to solve the problem that the simulation results of the finite difference method model are not precise enough and the conservation is poor, some scholars have established a pipe network hydrodynamic model based on the finite volume method. The finite volume method model divides the drainage pipe into fine pipe segments. Due to the characteristics of the explicit finite volume method, the calculation time step of the model is limited by the CFL condition. When the pipeline is in a pressurized flow state, the wave velocity of the pipe flow is the water hammer wave velocity, which can reach 100m / s, which further limits the calculation time step of the model. However, the calculation burden of the model based on the finite volume method is relatively heavy, and the calculation efficiency is often difficult to meet the requirements. In order to improve the practicality of the model, it is necessary to improve the calculation efficiency of the model based on parallel computing technology. At present, most of the related technical pipe network hydrodynamic models are serial versions, and the application of parallel computing technology, especially GPU parallel computing technology, is insufficient.

[0100] In addition, in order to facilitate calculation, it is generally necessary to introduce some assumptions to unify the control equations of the pipeline under open channel flow and pressurized flow. The most commonly used method at present is the Preissmann narrow slit method. The Preissmann narrow slit method assumes that there is a narrow slit at the top of the pipeline. When the water head in the pipeline is greater than the diameter of the pipeline, the pipeline is in a pressurized state. Based on this assumption, the control equation of the pipe flow can be greatly simplified and thus facilitated. However, there are certain problems in the application of the Preissmann narrow slit method. First, when the pressure wave velocity is large, the narrow slit is narrow, and it is easy to numerically oscillate when calculating the mixed flow; at the same time, Preissmann is difficult to simulate the water flow movement under negative pressure in the pipeline. One solution to the numerical oscillation problem is to increase the width of the narrow slit to indirectly reduce the water hammer wave velocity, but this treatment method does not conform to the physical nature. The increased narrow slit width allows more water to be stored in the narrow slit, thereby reducing the movement speed of the interface between the full pipe and the non-full pipe in the pipeline.

[0101] In view of this, the embodiment of the present application provides a method, device, electronic device and storage medium for parallel calculation of drainage pipe network. The scheme obtains the state variables of each pipe and each inspection well in the drainage pipe network; wherein each pipe is decomposed into multiple pipe segment units by multiple interfaces; the state variables corresponding to the pipe segment units on the left side of each interface and the state variables of each inspection well are mapped to the first array, and the state variables corresponding to the pipe segment units on the right side of each interface and the state variables of each inspection well are mapped to the second array; the numerical flux of each interface is calculated in parallel based on the first array and the second array at a preset time step; the numerical flux includes the mass flux and momentum flux of the water flow through the interface; according to the conservation of mass, energy and Riemann invariants, the water depth of each inspection well and the numerical flux of the interface corresponding to each pipe connected to each inspection well are solved; the numerical flux corresponding to the interfaces on the left and right sides of each pipe segment unit is conserved in parallel to obtain the state variables of each pipe segment unit at the next moment. This application decomposes each pipeline into multiple pipe segment units according to multiple interfaces, and then the numerical flux of each interface can be calculated in parallel on the GPU to improve the calculation efficiency. In addition, the segmented calculation is more accurate than the overall calculation, and can provide accurate simulation values ​​for the drainage network.

[0102] A drainage network parallel computing method provided in an embodiment of the present application relates to the technical field of water conservancy engineering. The drainage network parallel computing method provided in an embodiment of the present application can be applied to a terminal, can also be applied to a server, and can also be software running in a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, and a car terminal, etc., but is not limited to this; the server side can be configured as an independent physical server, or it can be configured as a server cluster or a distributed system composed of multiple physical servers, and can also be configured as a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The server can also be a node server in a blockchain network; the software can be an application that implements the drainage network parallel computing method, etc., but is not limited to the above forms.

[0103] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0104] Reference Figure 1 The present application embodiment provides a drainage network parallel computing method, which may include but is not limited to S100 to S140, as follows:

[0105] S100: Acquire the state variables of each pipeline and each inspection well in the drainage network; wherein each of the pipelines is decomposed into a plurality of pipe segment units by a plurality of interfaces.

[0106] Specifically, the drainage network in this embodiment may include multiple pipes and multiple inspection wells, and each pipe may be divided into multiple pipe segment units (referred to as pipe segments or units) by multiple interfaces. Figure 2 , this embodiment provides an example structural diagram of a drainage network.

[0107] State variables may include flow rate, cross-sectional area, pressure head, etc.

[0108] S110: Map the state variables corresponding to the pipe section units on the left side of each interface and the state variables of each inspection well into a first array, and map the state variables corresponding to the pipe section units on the right side of each interface and the state variables of each inspection well into a second array.

[0109] Specifically, this embodiment can allocate a global array in the SoA (Structure of Array) format in the CPU memory space to store the state variables on the left and right sides of all interfaces in each pipe section unit and the state variables of the inspection well.

[0110] The global array data storage structure in SoA format can be found in Figure 3 , where Q is the numerical flux of each pipeline, A is the water-passing cross-sectional area of ​​each pipeline, and E is the water depth of each inspection well.

[0111] In this embodiment, the pipeline is divided into multiple pipe sections. A virtual unit exists at the connection between the boundary pipe section and the inspection well, which is used to set the boundary conditions of the boundary pipe section simulation. Figure 4 .

[0112] Next, the mapping method of state variables is explained, such as Figure 5 As shown, in this embodiment, a global array can be allocated, and the size of the global array is equal to the number of all pipe sections of each pipeline plus the number of all inspection wells. The state variables of each pipe section are continuously filled into the global array according to the number of the pipeline, and the global array finally stores the state variables of the inspection well unit. An integer array is allocated for each pipeline and each inspection well, which is used to store the storage location in the global array. Figure 5 In the calculation array, the global array is used, and the inspection wells can also be called branch points, that is, the branch point array is the inspection well array.

[0113] Then, create two arrays of the same length, map the state variables corresponding to the pipe section units on the left side of each interface into one array, and map the state variables corresponding to the pipe section units on the right side of each interface into another array. Figure 6 As shown. Assume that a pipeline has n+1 interfaces, and interface 1 and interface n+1 are boundary interfaces. First, allocate two global arrays, the sizes of which are equal to the total number of all pipeline interfaces, which are used to store the state variables on the left and right sides of the interface respectively. According to the sequence of pipeline numbers, continuously establish the mapping relationship between the internal interfaces of each pipeline and the corresponding global arrays, and finally store the state variables of the boundary interfaces of each pipeline.

[0114] The mapping relationship between the interface and the pipe segment in the global array, and the mapping relationship between the pipe segment and the interface, are as follows: Figure 7 , Figure 8 As shown. For a local pipe segment, one interface is connected to two pipe segments (or inspection wells) on the left and right respectively; one pipe segment is connected to two interfaces upstream and downstream respectively. Since the state variables of the pipe segment, and the interface all have a unique mapping relationship in the global array, this embodiment can establish a mapping relationship between the interface and the pipe segment and a mapping relationship between the pipe segment and the interface according to the global array.

[0115] In this embodiment, an array of an integer structure can be allocated to store the mapping relationship. For the calculation arrays on the left and right sides of the interface, there are unique mapping relationships between the interface and the pipe section. For the calculation array of the pipe section, there are two mapping relationships for the pipe section, one mapping relationship for the inspection well at the boundary, and more than two mapping relationships for the internal inspection well.

[0116] Then, the global array in SoA format allocated in the CPU memory space is copied to the GPU space. The specific implementation method is to use the data copyin instruction provided by the OpenACC parallel computing method to copy the interface calculation array stored in the CPU memory to the unit calculation array (i.e. Figure 7 and Figure 8 The array shown in the figure is copied to the GPU space. The instruction to copy the array is as follows Fig. 9 As shown,

[0117] An example of using GPU to parallelize the numerical flux of a drainage network is shown in Fig.10 As shown in Figure 1, the parallel loop instruction provided by the OpenACC parallel computing method is used to accelerate the Riemann pass quantum program, where the present instruction explicitly specifies that the memory already exists in the GPU memory space.

[0118] S120: Calculate in parallel the numerical flux of each of the interfaces in the first array and the numerical flux of each of the interfaces in the second array at a preset time step; the numerical flux includes the mass flux and momentum flux of the water flow passing through the interface.

[0119] Furthermore, S120 may include S121 to S123:

[0120] S121: Determine that the control equation for the water flow in each of the pipes is a one-dimensional pipe flow equation.

[0121] Furthermore, S121 may include:

[0122] The one-dimensional pipe flow equation is determined as:

[0123]

[0124] in, A is the water flow cross-sectional area of ​​each of the pipes; Q is the flow rate of each of the pipes; I is the pressure term; P is the wetted perimeter; C D is the dimensionless friction parameter, R h =A / P, R h is the hydraulic radius; g is the acceleration due to gravity.

[0125] S122: When the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water-passing section of each of the pipes; when the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes.

[0126] The calculation of the pressure term under open channel flow conditions is different from that under pressurized flow conditions. Specifically, the action position of the pressure term under open channel flow conditions is the centroid of the water-passing section. When the pipe flow is under pressurized state, the pressure term is equal to the hydrostatic pressure when the pipe is full plus the pressure head. Therefore, further, S122 may include:

[0127] Calculate the pressure term in the one-dimensional pipe flow equation according to a first calculation formula;

[0128] The first calculation formula is:

[0129]

[0130] Wherein, θ is the water flow section angle of each of the pipes;

[0131] When the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes, including:

[0132] Calculate the pressure term in the one-dimensional pipe flow equation according to a second calculation formula;

[0133] The second calculation formula is:

[0134]

[0135] Wherein, d is the diameter of each of the pipes, H is the pressure head, and H is calculated by the third calculation formula;

[0136] The third calculation formula is:

[0137]

[0138] Where a is the pressure wave velocity; A P is the cross-sectional area of ​​each of the pipes.

[0139] Specifically, in this embodiment, the pressure head can be calculated according to the TPA (Two Component Approach) method: assuming that the simulated water flow cross-sectional area may not be equal to the pipe cross-sectional area when in a pressurized flow state, the pipe flow is in a positive pressure state when the water flow cross-sectional area is larger than the pipe cross-sectional area, and in a negative pressure state when it is smaller. The pressure head of the pipe flow can be calculated by the water hammer wave velocity, the water flow cross-sectional area, and the pipe cross-sectional area, as shown in the third calculation formula. The schematic diagram of the TPA method is shown in FIG. Fig.11 .

[0140] S123: Solving the one-dimensional pipe flow equation according to the pressure term at the preset time step to obtain the numerical flux of each interface.

[0141] Furthermore, S123 may include:

[0142] Discretizing the one-dimensional pipe flow equation according to the Godunov format finite volume method to obtain a target control equation;

[0143] Solving the target control equation using an approximate Riemann solution at the preset time step to obtain a numerical flux of each interface;

[0144] The target control equation is:

[0145]

[0146] Among them, n and n+1 are time steps;

[0147] The numerical flux of each of the interfaces is:

[0148] F i+1 / 2 =F HLL (h L ,h R ,H L ,H R ,Q L ,Q R );

[0149] in,

[0150] The preset time step is:

[0151]

[0152] Wherein, Δt is the preset time step, C r is the Courant number, with a value range of (0,1]; V 1d is the average water flow velocity of each of the pipe sections.

[0153] Specifically, according to the first-order accurate Godunov format finite volume method, the pipeline is divided into a series of uniform calculation units (ie, multiple pipe segments). Therefore, this embodiment can simulate the complex non-steady flow process in the pipeline according to the target control equation.

[0154] For the first-order accurate Godunov format finite volume method, the conserved variables on the left and right sides of the interface are considered to be equal to the variables at the center of the left and right pipe sections. Therefore, the water flux through the interface can be directly solved by the HLL (Harten, Lax and van Leer) approximate Riemann solution:

[0155] F i+1 / 2 =F HLL (h L ,h R ,H L ,HR ,Q L ,Q R );

[0156] Among them, F and F * The relationship can refer to the above description.

[0157] In addition, when the water depths in the left and right pipe sections are both greater than the critical water depth:

[0158] S L =min(V L -c L ,V * -c * );S R =max(V R +c R ,V * +c * );

[0159] When the pipe segment unit on the left side of the interface is a main pipe segment unit:

[0160] S L =V R -φ R ; S R =V R +c R ;

[0161] When the pipe segment unit on the right side of the interface is a main pipe segment unit:

[0162] S L =V L -c L ; S R =V L +φ L ;

[0163] Among them, F*, c*, V*, and θ* are:

[0164]

[0165]

[0166]

[0167] θ * =4arcsin(φ * / β(gd / 8) 1 / 2 );

[0168] This calculation format is an explicit format. In order to maintain the numerical stability during the calculation process, it is necessary to limit the time step in the calculation. In this embodiment, the CFL condition can be used to control the time step, that is:

[0169]

[0170] Where: C r is the Courant number, with a value range of (0,1]; V 1d is the average water flow velocity in the cross section.

[0171] S130: according to the conservation of mass, energy and Riemann invariant, solving the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface;

[0172] The inflow energy conservation equation of each of the pipelines connected to each of the inspection wells is determined as:

[0173]

[0174] The outflow energy conservation equation of each of the pipelines connected to each of the inspection wells is determined as:

[0175]

[0176] in, is the boundary water depth of the pipeline, is the critical water depth, h is the water depth of the edge pipe section unit of the pipeline; j is the water depth in the inspection well; d rj To connect the height difference between the bottom of the pipeline and the bottom of the inspection well;

[0177] The mass conservation equation is:

[0178]

[0179] Wherein, the superscripts n and n+1 are time steps; Q d is the water flow into the inspection well; Q o A is the water flow out of the inspection well; d is the area of ​​the inspection well; d is the water depth in the inspection well;

[0180] The Riemann invariants include the pressurized flow condition and the open channel flow condition:

[0181] The pressurized flow conditions are:

[0182]

[0183] The open channel flow conditions are:

[0184] du±(c / A)dA=0;

[0185] Among them, the + sign corresponds to the inlet pipe, the - sign corresponds to the outlet pipe, u is the flow velocity; and c is the wave velocity.

[0186] The above 2N+1 equations constitute a nonlinear equation group for solving the drainage network. This equation group cannot be solved directly, so the Newton-Raphson method (Newton-Raphson algorithm) is used for iterative solution, which generally requires 5 iterations to converge.

[0187] Specifically, the result obtained by iterative solution according to the above embodiment can predict the water flow into the inspection well and the water flow out of the inspection well in the next time step.

[0188] In addition, the embodiment of the present application can also determine the interaction between the water flow in the inspection well and the surface water, and the implementation steps may include:

[0189] Calculating the water flow from the surface into the inspection well according to the fourth calculation formula and calculating the water flow from the inspection well out of the surface according to the fifth calculation formula include:

[0190] The fourth calculation formula is:

[0191]

[0192] Among them, Q d H is the water flow into the inspection well; s is the height difference between the surface water level and the bottom of the inspection well, H s =h s +d j ;h j is the water depth in the inspection well; d rj The height difference between the bottom of the pipeline and the bottom of the inspection well; d j is the height of the inspection well;

[0193] The fifth calculation formula is:

[0194]

[0195] Among them, Q o A is the water flow out of the inspection well; j is the cross-sectional area of ​​the inspection well.

[0196] Further, Fig.12 A schematic diagram of the connection between a pipeline and an inspection well provided in this embodiment.

[0197] S140: performing conservation calculations on the numerical fluxes corresponding to the interfaces on the left and right sides of each of the pipe segment units in parallel to obtain state variables of each of the pipe segment units at the next moment.

[0198] Specifically, for each pipe section unit, the mass flux of the water flow through the left interface and the mass flux of the water flow through the right interface are conserved, and the momentum flux of the water flow through the left interface and the momentum flux of the water flow through the right interface are conserved. The conservation calculations corresponding to each pipe section unit can be performed in parallel.

[0199] The embodiment of the present application provides a drainage network calculation method based on GPU parallelism. The embodiment of the present application can simulate the water flow movement in the drainage network based on the one-dimensional pipe flow equation, discretize the control equation based on the Godunov format finite volume method with first-order accuracy, and use the TPA method to calculate the pressure head of the pipeline when the pipeline is in a pressurized flow state. In addition, the embodiment of the present application also provides a state variable mapping method that fully utilizes the computing performance of the GPU, continuously stores the state variables of each pipe section and each inspection well into an array, and saves them to the GPU space through the data copy instruction provided by the OpenACC parallel computing method, and saves the data in the form of SoA (Structure of Array). Establish a topological relationship between the interface and the computing unit (the computing unit includes the inspection well and the pipe section unit) in the global array, as well as a topological relationship between the computing unit and the interface. According to the establishment of the topological relationship, the state variables on the left and right sides of the interface and the numerical flux of all interfaces connected to the computing unit can be easily obtained, which is convenient for calculation.

[0200] Next, the solution of the embodiment of the present application will be described in detail and explained in conjunction with specific application examples:

[0201] Reference Fig.13 , this embodiment provides an example flow chart of a parallel computing method for a drainage network.

[0202] This embodiment may include: 1. There are many local arrays in the CPU space, which are used to store the state variables of the left and right sides of an interface in a pipe & the center state variables; 2. A global array is constructed to store the state variables of the left and right sides of all pipe interfaces in a drainage network & the state variables of the unit center and the inspection well; 3. A mapping relationship between the local array and the global array is constructed; 4. The global array is copied to the GPU space using OpenACC instructions for calculation, and is copied to the CPU space only when the calculation results are output; 5. Based on the mapping relationship between the local array and the global array, the topological relationship between the interface array and the center array in the global array, and the topological relationship between the center array and the local array are established. 6. Based on the global array parallel calculation, the numerical flux of all interfaces is obtained; based on the numerical flux of all interfaces, conservation calculation is performed to obtain the state variables of the unit center & the inspection well at the next moment.

[0203] The output calculation results include: flow rate, area, velocity, head of each pipe section in each pipeline, and water depth of the inspection well. Boundary condition calculation is used to obtain the numerical flux of each pipeline boundary interface, and interface flux calculation obtains the numerical flux of each internal interface of each pipeline and the state variable at the interface at the next moment. Numerical flux is used to support unit conservation calculation, which is calculated based on the numerical flux on the left and right sides of the interface to obtain the simulation results of the next time step (pipe section water flow area, pipe section water flow rate).

[0204] Specifically, this embodiment can abstract the drainage network into multiple pipes and multiple inspection wells, wherein each pipe is divided into a number of pipe section units of uniform size.

[0205] Based on the JSON (JavaScript Object Notation) format, the initial state variables such as the flow rate, water flow area, water head and water level of the rainwater inspection well node of the pipeline and the key calculation parameters such as the pipeline length, starting point coordinates, diameter, wave velocity, Manning roughness and inspection well depth, bottom elevation, coordinates, area, etc. are stored. Then, the one-dimensional pipe flow equation is used as the control equation to simulate the movement of water flow in the pipeline. The one-dimensional pipe flow equation has both open channel flow and pressurized flow. The calculation of the pressure term in the one-dimensional pipe flow equation (the calculation formula can refer to the above embodiment) is distinguished according to the open channel flow and pressurized flow state of the pipe flow. The open channel flow state is calculated according to the geometric shape of the water flow section, and the influence of the pipeline pressure head is considered in the pressurized flow state. TPA (Two Component Approach) is used to calculate the pressure head when the pipeline is in a pressurized flow state.

[0206] Then, the first-order accurate Godunov format finite volume method is used to solve the control equations. The pipeline is discretized into uniform one-dimensional pipeline units. There is an interface between pipeline units. There is a unique topological relationship between pipeline units and interfaces, that is, the left and right sides of the interface correspond to unique pipeline units, and the left and right sides of the pipeline units correspond to unique interfaces. Considering the characteristic line equations, energy conservation equations, and water conservation equations at the inspection well, the internal boundary conditions of the pipeline network simulation are constructed, and then the approximate Riemann operator is used to solve the numerical flux of the pipeline.

[0207] The state variables of each pipeline and each inspection well are stored using independent data classes. A global array in the SoA (Structure of Array) format is allocated in the CPU memory space to store the state variables of all pipe section unit centers, the left and right sides of the interface, and the state variables of the inspection wells.

[0208] The mapping relationship between each pipe segment array and the global array is established to obtain the corresponding position of each pipe segment in the global variable. Based on the topological relationship between each pipe segment and the interface, the mapping relationship between the global pipe segment center array and the global interface array is generated.

[0209] The global array in the CPU memory space is copied to the GPU space through OpenACC instructions. Based on the established global array, the OpenACC parallel instructions are used to accelerate the calculation on the GPU. First, the numerical flux of the internal interface of the pipeline is calculated based on the global array, and then the numerical flux at the pipeline interface is calculated. Then the numerical flux of the pipeline and the manhole is updated.

[0210] The calculation time step of the pipeline is calculated according to the CFL (Courant–Friedrichs–Lewy) condition. The calculation is based on the gravity wave velocity in open channel flow conditions and the water hammer wave velocity in pressurized flow conditions.

[0211] When outputting calculation results, relevant data is downloaded from the GPU unit to the host memory space and assigned to the data classes of each pipeline and inspection well for output.

[0212] This embodiment can realize two-way interaction of discharge and overflow with the surface runoff model. The drainage network model sets an interface function on the inspection well to obtain the amount of water flowing into / overflowing the inspection well of the network in real time.

[0213] This embodiment can simulate the water head, flow rate, water depth at any position of the pipeline and the water volume at the inspection well node.

[0214] Reference Fig.14 The embodiment of the present application further provides a drainage network parallel computing device, which can implement the above drainage network parallel computing method, and the device includes:

[0215] A state variable acquisition unit is used to acquire the state variables of each pipeline in the drainage network and the state variables of each inspection well; wherein each of the pipelines is decomposed into a plurality of pipe section units by a plurality of interfaces;

[0216] A state variable mapping unit, used to map the state variables corresponding to the pipe section units on the left side of each interface and the state variables of each inspection well into a first array, and map the state variables corresponding to the pipe section units on the right side of each interface and the state variables of each inspection well into a second array;

[0217] A numerical flux calculation unit, configured to calculate the numerical flux of each of the interfaces in parallel based on the first array and the second array at a preset time step; the numerical flux includes a mass flux and a momentum flux of the water flow passing through the interface;

[0218] A water flow variation determination unit, used to solve the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface according to mass, energy conservation and Riemann invariant;

[0219] The conservation calculation unit is used to perform conservation calculations on the numerical fluxes corresponding to the interfaces on the left and right sides of each of the pipe section units in parallel to obtain the state variables of each of the pipe section units at the next moment.

[0220] It can be understood that the contents of the above method embodiments are all applicable to the present device embodiments, the functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0221] The embodiment of the present application also provides an electronic device, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the above-mentioned drainage network parallel calculation method when executing the computer program. The electronic device can be any intelligent terminal including a tablet computer, a car computer, etc.

[0222] It can be understood that the contents of the above method embodiments are all applicable to the present device embodiments, the functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0223] See also Fig.15 , Fig.15 The hardware structure of an electronic device of another embodiment is illustrated, and the electronic device includes:

[0224] The processor 1501 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0225] The memory 1502 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1502 can store an operating system and other application programs. When the technical solution provided in the embodiment of this specification is implemented by software or firmware, the relevant program code is stored in the memory 1502, and the processor 1501 calls and executes the drainage network parallel computing method of the embodiment of this application;

[0226] Input / output interface 1503, used to implement information input and output;

[0227] Communication interface 1504, used to realize communication interaction between the device and other devices, which can be realized through wired mode (such as USB, network cable, etc.) or wireless mode (such as mobile network, WIFI, Bluetooth, etc.);

[0228] A bus 1505 that transmits information between the various components of the device (e.g., the processor 1501, the memory 1502, the input / output interface 1503, and the communication interface 1504);

[0229] The processor 1501 , the memory 1502 , the input / output interface 1503 and the communication interface 1504 are connected to each other in communication within the device via the bus 1505 .

[0230] An embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above-mentioned drainage network parallel computing method is implemented.

[0231] It can be understood that the contents of the above method embodiments are all applicable to the present storage medium embodiments, the functions specifically implemented by the present storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0232] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0233] The embodiments described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0234] Those skilled in the art will appreciate that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.

[0235] The device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0236] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0237] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0238] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0239] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the above units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0240] The units described above as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0241] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0242] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including multiple instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store programs.

[0243] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but the scope of the rights of the present invention is not limited thereto. Any modification, equivalent substitution and improvement made by a person skilled in the art without departing from the scope and essence of the present invention should be within the scope of the rights of the present invention.

Claims

1. A drainage network parallel computing method, characterized in that: The method comprises: Obtaining the state variables of each pipeline and each inspection well in the drainage network; wherein each of the pipelines is decomposed into a plurality of pipe segment units by a plurality of interfaces; Mapping the state variables corresponding to the pipe section units on the left side of each interface and the state variables of each inspection well into a first array, and mapping the state variables corresponding to the pipe section units on the right side of each interface and the state variables of each inspection well into a second array; Calculating the numerical flux of each interface in parallel based on the first array and the second array at a preset time step; the numerical flux includes the mass flux and momentum flux of the water flow passing through the interface; According to the conservation of mass, energy and Riemann invariants, the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface are solved; Performing conservation calculations on the numerical fluxes corresponding to the interfaces on the left and right sides of each pipe segment unit in parallel to obtain state variables of each pipe segment unit at the next moment; The calculating the numerical flux of each interface in parallel based on the first array and the second array at a preset time step includes: Determine that the control equation of water flow movement in each of the pipes is a one-dimensional pipe flow equation; When the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water-passing section of each of the pipes; when the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes; Solving the one-dimensional pipe flow equation according to the pressure term at the preset time step to obtain the numerical flux of each interface; The control equation for determining the water flow movement in each of the pipes is a one-dimensional pipe flow equation, including: The one-dimensional pipe flow equation is determined as: in, ; A is the water flow cross-sectional area of ​​each of the pipes; Q is the flow rate of each of the pipelines; I is the pressure term; P For wet week; C D is the dimensionless friction parameter, ; R h = A / P , R h is the hydraulic radius; g is the acceleration due to gravity; When the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water-passing section of each of the pipes, including: Calculate the pressure term in the one-dimensional pipe flow equation according to a first calculation formula; The first calculation formula is: ; in, θ is the water-passing cross-sectional angle of each of the pipes; When the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes, including: Calculate the pressure term in the one-dimensional pipe flow equation according to a second calculation formula; The second calculation formula is: ; in, d is the diameter of each of the pipes, H is the pressure head, H Calculated by the third formula; The third calculation formula is: ; in, a is the pressure wave velocity; A P is the cross-sectional area of ​​each of the pipes.

2. A drainage network parallel computing method according to claim 1, characterized in that: Solving the one-dimensional pipe flow equation according to the pressure term at the preset time step to obtain the numerical flux of each interface includes: Discretizing the one-dimensional pipe flow equation according to the Godunov format finite volume method to obtain a target control equation; Solving the target control equation using an approximate Riemann solution at the preset time step to obtain a numerical flux of each interface; The target control equation is: ; in, n , n +1 is the time step; The numerical flux of each of the interfaces is: ; in, ; ; The preset time step is: ; in, is the preset time step, C r is the Courant number, and its value range is (0, 1]; V 1d is the average water flow velocity of each of the pipe sections.

3. A drainage network parallel computing method according to claim 2, characterized in that: The method of solving the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface according to the conservation of mass, energy and Riemann invariant includes: According to the state variables of each pipe section unit and each inspection well, the water depth of each inspection well and the numerical flux corresponding to each pipeline connected to each inspection well are solved based on the mass conservation equation, the energy conservation equation and the Riemann invariant; The inflow energy conservation equation of each of the pipelines connected to each of the inspection wells is determined as: ; The outflow energy conservation equation of each of the pipelines connected to each of the inspection wells is determined as: ; in, is the boundary water depth of the pipeline; h j is the water depth in the inspection well; d rj To connect the height difference between the bottom of the pipeline and the bottom of the inspection well; The mass conservation equation is: ; Among them, the superscript n and n +1 is the time step; Q d is the water flow into the inspection well; Q o is the water flowing out of the inspection well; A d is the area of ​​the inspection well; y d is the water depth in the inspection well; The Riemann invariants include the pressurized flow condition and the open channel flow condition: The pressurized flow conditions are: ; The open channel flow conditions are: ; Among them, the + sign corresponds to the inflow pipe, and the - sign corresponds to the outflow pipe. u is the flow rate; c For wave speed.

4. A drainage network parallel computing method according to claim 3, characterized in that: The method further comprises: Calculating the water flow from the surface into the inspection well according to the fourth calculation formula and calculating the water flow from the inspection well out of the surface according to the fifth calculation formula include: The fourth calculation formula is: ; in, Q d is the water flow into the inspection well; H s is the height difference between the surface water level and the bottom of the inspection well, H s = h s + d j ; h j is the water depth in the inspection well; d rj To connect the height difference between the bottom of the pipeline and the bottom of the inspection well; d j is the height of the inspection well; The fifth calculation formula is: ; in, Q o is the water flowing out of the inspection well; A j is the cross-sectional area of ​​the inspection well.

5. A drainage network parallel computing device, characterized in that: The device comprises: A state variable acquisition unit is used to acquire the state variables of each pipeline in the drainage network and the state variables of each inspection well; wherein each of the pipelines is decomposed into a plurality of pipe section units by a plurality of interfaces; A state variable mapping unit, used to map the state variables corresponding to the pipe section units on the left side of each interface and the state variables of each inspection well into a first array, and map the state variables corresponding to the pipe section units on the right side of each interface and the state variables of each inspection well into a second array; A numerical flux calculation unit, configured to calculate the numerical flux of each of the interfaces in parallel based on the first array and the second array at a preset time step; the numerical flux includes a mass flux and a momentum flux of the water flow passing through the interface; A water flow variation determination unit, used to solve the water depth of each inspection well and the numerical flux of each pipeline connected to each inspection well corresponding to the interface according to mass, energy conservation and Riemann invariant; A conservation calculation unit, used for performing conservation calculations on the numerical fluxes corresponding to the interfaces on the left and right sides of each of the pipe section units in parallel to obtain state variables of each of the pipe section units at the next moment; The calculating the numerical flux of each interface in parallel based on the first array and the second array at a preset time step includes: Determine that the control equation of water flow movement in each of the pipes is a one-dimensional pipe flow equation; When the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water-passing section of each of the pipes; when the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes; Solving the one-dimensional pipe flow equation according to the pressure term at the preset time step to obtain the numerical flux of each interface; The control equation for determining the water flow movement in each of the pipes is a one-dimensional pipe flow equation, including: The one-dimensional pipe flow equation is determined as: in, ; A is the water flow cross-sectional area of ​​each of the pipes; Q is the flow rate of each of the pipelines; I is the pressure term; P For wet week; C D is the dimensionless friction parameter, ; R h = A / P , R h is the hydraulic radius; g is the acceleration due to gravity; When the water flow in each of the pipes is in an open channel flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the geometric shape of the water-passing section of each of the pipes, including: Calculate the pressure term in the one-dimensional pipe flow equation according to a first calculation formula; The first calculation formula is: ; in, θ is the water-passing cross-sectional angle of each of the pipes; When the water flow in each of the pipes is in a pressurized flow state, the pressure term in the one-dimensional pipe flow equation is calculated according to the pressure head of each of the pipes, including: Calculate the pressure term in the one-dimensional pipe flow equation according to a second calculation formula; The second calculation formula is: ; in, d is the diameter of each of the pipes, H is the pressure head, H Calculated by the third formula; The third calculation formula is: ; in, a is the pressure wave velocity; A P is the cross-sectional area of ​​each of the pipes.

6. An electronic device, characterized in that: The electronic device comprises a memory and a processor, the memory stores a computer program, and the processor implements the method according to any one of claims 1 to 4 when executing the computer program.

7. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.