Parallel Implementation of the Algorithm to Compute Forest Fire Impact on Infrastructure Facilities of JSC Russian Railways

: Forest ﬁres have a negative impact on the economy in a number of regions, especially in Wildland Urban Interface (WUI) areas. An important link in the ﬁght against ﬁres in WUI areas is the development of information and computer systems for predicting the ﬁre safety of infrastructural facilities of Russian Railways. In this work, a numerical study of heat transfer processes in the enclosing structure of a wooden building near the forest ﬁre front was carried out using the technology of parallel computing. The novelty of the development is explained by the creation of its own program code, which is planned to be put into operation either in the Information System for Remote Monitoring of Forest Fires ISDM-Rosleskhoz, or in the information and computing system of JSC Russian Railways. In the Russian Federation, it is forbidden to use foreign systems in the security services of industrial facilities. The implementation of the deterministic model of heat transfer in the enclosing structure with the complexity of the algorithm O (2N 2 + 2K) is presented. The program is implemented in Python 3.x using the NumPy and Concurrent libraries. Calculations were carried out on a multiprocessor cluster in the Sirius University of Science and Technology. The results of calculations and the acceleration coefﬁcient for operating modes for 1, 2, 4, 8, 16, 32, 48 and 64 processes are presented. The developed algorithm can be applied to assess the ﬁre safety of infrastructure facilities of Russian Railways. The main merit of the new development should be noted, which is explained by the ability to use large computational domains with a large number of computational grid nodes in space and time. The use of caching intermediate data in ﬁles made it possible to distribute a large number of computational nodes among the processors of a computing multiprocessor system. However, one should also note a drawback; namely, a decrease in the acceleration of computational operations with a large number of involved nodes of a multiprocessor computing system, which is explained by the write and read cycles in cache ﬁles.


Introduction
Forest fires represent a natural phenomenon that causes economic and societal losses around the world [1,2]. The size of a forest fire in 3-5% of cases reaches 100 hectares [3]. At the same time, only 1% of the largest fires account for 80-96% of the burnt area [4]. The spread of WUI zones provides greater contact between wild vegetation and anthropogenic activity, which can cause an increase in the zones of possible sources of ignition and, as a consequence, an increased destructive effect [5,6]. In the event of a forest fire, not only vegetation, but also soil, suffers. Heat is transferred down to colder areas deeper in the soil, which can lead to an increase in soil temperature in shallow subsurface layers up to 600 • C [7]. Such extremely high temperatures can irreversibly change the biological and chemical properties of the soil, significantly reduce the water content in the soil and damage all organisms contained within [8][9][10][11] computing technology based on cluster computing and Python high level programming language with specific library support.
The main merit of the new development should be noted, which is explained by the ability to use large computational domains with a large number of computational grid nodes in space and time. The use of caching intermediate data in files made it possible to distribute a large number of computational nodes among the processors of a computing multiprocessor system. However, one should also note a drawback, namely, a decrease in the acceleration of computational operations with a large number of involved nodes of a multiprocessor computing system, which is explained by the write and read cycles in cache files. The need to use rather small pieces of data is due to the future operation of the program code in computing systems based on Russian workstations and multiprocessor computing systems based on Elbrus processors. Russian computing systems are still inferior in performance and RAM compared to similar systems based on Intel and AMD processors.

Initial Data
This paper considers the scenarios described in [61]. Consideration of scenarios with a known solution will make it possible to verify the operation of the algorithm. Table 1 shows the thermophysical characteristics of materials. The conditions required for the ignition of a sample can be determined using experimental data [63], which provides data on the effect of thermal radiation on wood samples. This approach makes it possible to determine the energy consumption for the ignition of the sample. The data on the ignition of a wood sample by a radiant heat flux are presented in Table 2. The data on the absorption coefficients of various types of paint are presented in Table 3. Table 2. Experimental data on wood ignition by radiant heat flux [63].  Table 3. Absorption coefficients for different types of paint [62].

Mathematical Statement and Methodology
The object of the study was a wooden structure of thickness l and height h, located next to a forest fire. The front of fire spreads at a low speed in the absence of wind. The enclosing structures of this building are presented in the form of a layer of wood material. Heat from the forest fire front is transferred to the wall by thermal radiation. The main safety parameter of a wooden structure is the fact of ignition (or non-ignition) of the enclosing structure of a wooden building when a sufficient surface temperature is reached.
The following assumptions were made: • In the enclosing structures, heat exchange is carried out by the heat conduction mechanism; • Two-dimensional setting; • The shape of the fire front is a parabola; • Thermophysical properties of building materials do not depend on temperature; • A catastrophic scenario of fire weather is assumed when there is no moisture in the surface layer of the wall; • Disregard wood pyrolysis; • The main mechanism of heat transfer from the line of fire to the building is heat radiation; • The temperature of the forest fire front is taken into account using the Stefan-Boltzmann law; • The impact of the forest fire front on the wall is determined by q ff and T ff .
The wooden structure is under the influence of the heat flow from the forest fire front q ff . On the surface of the fence exposed to the heat flow from the forest fire front, the material itself becomes a radiation source.
The physical model diagram is shown in Figure 1.

Mathematical Statement and Methodology
The object of the study was a wooden structure of thickness l and height h, located next to a forest fire. The front of fire spreads at a low speed in the absence of wind. The enclosing structures of this building are presented in the form of a layer of wood material. Heat from the forest fire front is transferred to the wall by thermal radiation. The main safety parameter of a wooden structure is the fact of ignition (or non-ignition) of the enclosing structure of a wooden building when a sufficient surface temperature is reached.
The following assumptions were made: • In the enclosing structures, heat exchange is carried out by the heat conduction mechanism; • Two-dimensional setting; • The shape of the fire front is a parabola; • Thermophysical properties of building materials do not depend on temperature; • A catastrophic scenario of fire weather is assumed when there is no moisture in the surface layer of the wall; • Disregard wood pyrolysis; • The main mechanism of heat transfer from the line of fire to the building is heat radiation; • The temperature of the forest fire front is taken into account using the Stefan-Boltzmann law; • The impact of the forest fire front on the wall is determined by qff and Tff.
The wooden structure is under the influence of the heat flow from the forest fire front qff. On the surface of the fence exposed to the heat flow from the forest fire front, the material itself becomes a radiation source.
The physical model diagram is shown in Figure 1. For the numerical solution of the differential equation of heat conduction, the finite difference method described in [64,65] was used: For the numerical solution of the differential equation of heat conduction, the finite difference method described in [64,65] was used: where ρ, c, λ, T are the density, heat capacity, heat conduction coefficient and temperature; Q w is the heat source inside the decision area; t is the temporal coordinate; x, y, z are the spatial coordinates. An implicit difference scheme was used for the solution. The left boundary condition was used to determine the coefficients α and β from the relation where T 1 , T 2 are the temperature in computational mesh nodes number 1 and 2; α 1 is the first running coefficient number 1; β 1 is the second running coefficient number 1. The right boundary condition is used to determine the temperature at the boundary x = L; for the number of nodes N, the temperature at the boundary will have the form T N (K). The boundary conditions have been discredited to the first order of approximation. It is assumed that a forest fire front is approaching the structure from the left side. Convectionradiation heat transfer at the boundary of the enclosing structure is calculated as an approximation on the left and right boundaries.
On the left border: where T 1 is the temperature in the first node of computational mesh; T ff is the temperature in the fire front; λ 1 is heat conduction coefficient of first layer of the enclosing construction of the wall; α is the heat transfer coefficient; ε is the emissivity factor; σ is the Stefan-Boltzmann constant; q ff is the heat flux from fire line; x is the spatial coordinate. Then: where α 1 is the first running coefficient; β 1 is the second running coefficient; λ 1 is the heat conduction coefficient of the first layer of enclosing construction of the wall; α is the heat transfer coefficient; ε is the emissivity factor; σ is the Stefan-Boltzmann constant; q ff is the heat flux from fire line; T 1 is the temperature in the first node of computational mesh; T ff is the temperature in the fire front; h is the spatial step in x-direction.
On the right border, the temperature is equal to the indoor temperature, boundary conditions of the first kind: where T 2 is the temperature in the second layer of the enclosing construction of the wall; T e is the temperature of the indoor environment of the object; x N is the thickness of the wall; λ 2 is the heat conduction coefficient of the second layer of enclosing construction of the wall; α is the heat transfer coefficient; x is the spatial coordinate.
Since there is a nonlinear component on the left boundary, heating according to the Stefan-Boltzmann law, to refine the temperature on the left boundary, it is necessary to use the method of simple iterations. To take into account the temperature distribution over depth, a two-dimensional mathematical model was used.
The mathematical model is represented by a two-dimensional non-stationary heat conduction equation.
The left border is exposed to radiant heat flux: Initial conditions: The formula for calculating the heat flux of the front of the surface forest fire [61]: The formula for calculating the heat flux of the front of a crown forest fire [61]: As a result of processing data on the falling heat fluxes from the forest fire front [61], equations were obtained. These equations are most consistent with the experimental data [66].
Dependence of heat flux on distance [66]: Dependence of heat flux on flame height [66]: where ρ i , c i , λ i , T i are the density, heat capacity, heat conduction coefficient and temperatures in the first and second layers of the enclosing construction of wall; T e is the indoor environment temperature; q ff is the resulting heat flux from fire front; q fd is the heat flux component depending on distance from wall to fire front; q fh is the heat flux component depending on fire front height; k is the coefficient for law that similar to Bouguer-Lambert-Beer law; ε is the emissivity factor; σ is the Stefan-Boltzmann constant; α is the heat transfer coefficient; xf is the current distance from wall to fire front until the end of exposure; d is the initial distance from wall to fire front; x, y are the spatial coordinates; t is the temporal coordinate; t exp is the exposure time from fire front.

Parallel Implementation
To implement parallel computing in Python 3.x, the multiprocessing module was used. This module allows us to conveniently start many processes asynchronously. At the beginning of the program in the synchronous mode, the variables required for the calculation are initialized. The values α 1 and β 1 are also calculated, arrays of initial values of the temperature field and coordinate axes are created and filled. After that, the nodes are evenly divided into sections along the X and Z axes. After dividing the computational grid, the start and end points of the process are set for each process. The processes are launched within the specified ranges along the Z axis with accuracy L (Figure 2). During the process, locally one-dimensional problems are solved for each L(n) included in the range L(start, end).
In a case when the number of nodes is divided by the number of processes without a remainder, the smallest matrix is calculated in the process that is launched last. In this case, the result of the last process can be put into memory before the rest. For this, the results of the calculations of the processes enters the memory with the indication of the index of the process in which they were calculated. In a case when the number of nodes is divided by the number of processes without a remainder, the smallest matrix is calculated in the process that is launched last. In this case, the result of the last process can be put into memory before the rest. For this, the results of the calculations of the processes enters the memory with the indication of the index of the process in which they were calculated.  At the moment, in the process, the temperature field T(i, L) is being calculated where L(start, end) are determined by the number of processes, and i is the indices of an element in an array of length N ( Figure 3). The boundary conditions at the boundary T(N, L) are also redefined using the method of simple iterations, and the surface temperature TS(i) is recalculated for each i-th node along N. At the time the process is running, the data processed by the process is placed in RAM and the process index is assigned to them, so after all processes are finished, the full computational grid with the calculated sections for each process is stored in memory. Further, the data obtained as a result of the work of each process is combined in memory. The file memory data is collected into a matrix, which is transposed for ease of use, and unnecessary sections that have not been processed by the process are removed. From these data, a final data set is collected, which corresponds to a matrix with the same surface as the initial temperature field. Next, the matrix is transposed and placed in processes to perform an X-axis run. Now the processes are launched within the specified ranges along the X axis with accuracy N. In the process, locally one-dimensional problems are solved for each N(n) included in the range N(start, end).
In this case, the process calculates the temperature field T(N, j) where N is determined by the number of processes, and j is the indices of the element in the array of length L. As a result of the process, the collected matrix is recalculated along the perpendicular coordinate axis, and the data is written into memory. After that, the data from memory is cleared of sections that did not take part in the process. A common matrix is then assembled. After that, the total matrix is placed in memory, but already in another variable with the index of the time iteration. After the condition t > tend is fulfilled, a dictionary in which the key is the time iteration and the value of the array of temperature values at this iteration, the matrix is placed in a JSON file, and a file is created with logs on the total running time of the algorithm, heat fluxes, the lifetime of each process, and initial conditions. A block diagram is presented in Figure 4. process are removed. From these data, a final data set is collected, which corresponds to a matrix with the same surface as the initial temperature field. Next, the matrix is transposed and placed in processes to perform an X-axis run. Now the processes are launched within the specified ranges along the X axis with accuracy N. In the process, locally onedimensional problems are solved for each N(n) included in the range N(start, end). In this case, the process calculates the temperature field T(N, j) where N is determined by the number of processes, and j is the indices of the element in the array of length L. As a result of the process, the collected matrix is recalculated along the perpendicular coordinate axis, and the data is written into memory. After that, the data from memory is cleared of sections that did not take part in the process. A common matrix is then assembled. After that, the total matrix is placed in memory, but already in another variable with the index of the time iteration. After the condition t > tend is fulfilled, a dictionary in which the key is the time iteration and the value of the array of temperature values at this iteration, the matrix is placed in a JSON file, and a file is created with logs on the total running time of the algorithm, heat fluxes, the lifetime of each process, and initial conditions. A block diagram is presented in Figure 4.
where p is the number of operations that are necessary to calculate one cycle iteration, NV is the number of cycle iterations, c is the node productivity. Then if NV > M and NV is divided by M without a reminder, the cycle iterations NV M are carried out on each processor. The time of cycle performance is Acceleration S M can be defined using relationship T 0 to T M and, as a result, obtain This formula is proven for acceleration and is fair in full absence of losses. The efficiency of parallel computing is calculated using the formulas presented in [67]: where T 0 is the calculation time in sequential mode, T M is the calculation time using M processes. This ratio allows you to calculate the efficiency factor without taking into account losses.
In the case when during the operation of the algorithm, there are performance losses for creating and closing processes, as well as losses for data exchange. In this case, the process running time will be described by the T' M parameter. Efficiency is calculated using the formula [67]: Acceleration can be calculated using the formula [67]: The calculations were performed on a multiprocessor cluster in the Sirius University of Science and Technology, which consists of 40 computing nodes (Dell PowerEdge R640 Server) and one management server (Dell PowerEdge R640 Server), interconnected using an Infiniband computer network and an Ethernet network for monitoring and managing jobs. Computing nodes are numbered continuously in the form "cn-X" (where X is a number from 001 to 040).
Each computational node includes: The parallel program is written in Python 3.x. Anaconda version 4.6.2 was used as an interpreter since parallel settlement is performed within one main process. Then the efficiency is considered for each of the calculation blocks separately. Figure 5 shows how the efficiency of a parallel program depends on the number of processes involved in the calculation for the first computational block.
The actual efficiency decreases in comparison with the estimated one. This may be due to the fact that the operating time of the function called by the process is less than the time of the process call, and in this case, with a further increase in the number of processes, the efficiency will not increase, but will only decrease.
With a further increase in the number of processes, the total execution time is expected to decrease; however, after 16 processes, the efficiency begins to decrease, since the acceleration on each individual process can no longer cover the increase in the time for data merging.
The dependence of the acceleration on the program of the first block is shown in Figure 7.   efficiency is considered for each of the calculation blocks separately. Figure 5 shows how the efficiency of a parallel program depends on the num processes involved in the calculation for the first computational block.    The actual efficiency decreases in comparison with the estimated one. This m due to the fact that the operating time of the function called by the process is less tha time of the process call, and in this case, with a further increase in the number of proc the efficiency will not increase, but will only decrease.
With a further increase in the number of processes, the total execution time pected to decrease; however, after 16 processes, the efficiency begins to decrease, sin acceleration on each individual process can no longer cover the increase in the tim data merging.
The dependence of the acceleration on the program of the first block is shown i   The dependence of the acceleration on the program of the second block is shown in Figure 8.
lgorithms 2021, 14, x FOR PEER REVIEW 13 The dependence of the acceleration on the program of the second block is sho Figure 8. The real speedup is slightly less than the estimated one, since a fraction of the t lost when sending data at the beginning and when collecting results at the end parallel program execution. It seems that the speedup decreases as the number of p sors increases, although the computational load on each process decreases. Figure 9 shows the total running time of the algorithm in relation to the synchro implementation. The relative time was chosen to determine the dependence of the e tion time on the number of processes in general. The real speedup is slightly less than the estimated one, since a fraction of the time is lost when sending data at the beginning and when collecting results at the end of the parallel program execution. It seems that the speedup decreases as the number of processors increases, although the computational load on each process decreases. Figure 9 shows the total running time of the algorithm in relation to the synchronous implementation. The relative time was chosen to determine the dependence of the execution time on the number of processes in general. Figure 9 shows the total running time of the algorithm in relation to the synchro implementation. The relative time was chosen to determine the dependence of the e tion time on the number of processes in general.  Although the execution time of each individual process decreases as the number of processes increases, the total time for 2 processes in relation to 1 process increases. The increase in total time when working with 2 processes can be explained by the fact that data fusion takes a lot of time, and therefore the time savings on each separate process are not significant.
However, we managed to get a productivity increase of 29% for 8 and 16 processes. A further increase in the number of processes leads to a slowdown in the calculation and is not advisable. Thus, we can conclude that the most effective application of the algorithm is the parallelization of subtasks within the framework of parallel calculation of various input data.
The considered algorithm is well suited for parallel implementation using multiprocessor systems; however, calibration is required by the number of processes and the amount of input data. Efficiency depends on the number of processes and its change can have a positive and negative direction.

Results and Discussion
To carry out test calculations and the possibility of further validation of the algorithm, we used the scenarios from [61]. During the modeling process, three types of forest fires were considered. A surface forest fire of low intensity, characterized by a low front height, about 1 m and a low propagation speed of 0.015 m/s over a layer of ground forest fuel. For the second type, a surface forest fire of high intensity, was adopted that fire was characterized by a higher flame height of about 1.5 m and an increased propagation velocity of 0.05 m/s. The main distinguishing feature of a high-intensity surface forest fire from a low-intensity one is that of a high-intensity fire. The increased height of the flame leads to an increase in the speed of movement of the forest fire front. The last type is a crown forest fire, the height of the flame reaches the height of the tree crowns. Due to the greatly increased height of the flame, the propagation speed increases and is 0.33 m/s. A thin wall with a thickness of 0.02 m was considered as the enclosing structure. This thickness was adopted because the heating of wood during a fire does not occur by more than 0.02 m [61,68]. A low-intensity forest fire front starts to move at a distance of 20 m from the enclosing structure. The material of construction is plywood. The front speed is set at 0.015 m/s, the flame height is 1 m. The estimated time is 425 s. The calculation results are shown in Figure 10.
greatly increased height of the flame, the propagation speed increases and is 0.33 m/s. thin wall with a thickness of 0.02 m was considered as the enclosing structure. This thic ness was adopted because the heating of wood during a fire does not occur by more th 0.02 m [61,68]. A low-intensity forest fire front starts to move at a distance of 20 m fro the enclosing structure. The material of construction is plywood. The front speed is set 0.015 m/s, the flame height is 1 m. The estimated time is 425 s. The calculation results a shown in Figure 10.  A high-intensity surface forest fire front starts to move at a distance of 20 m from the enclosing structure. The material of construction is plywood. The front speed is set to 0.05 m/s, the flame height is 1.5 m. The estimated time is 350 s. The calculation time is recorded less; in our discussion of the results it is described in detail why this is so. The calculation results are shown in Figure 11. A high-intensity surface forest fire front starts to move at a distance of 20 m from enclosing structure. The material of construction is plywood. The front speed is set to m/s, the flame height is 1.5 m. The estimated time is 350 s. The calculation time is recor less; in our discussion of the results it is described in detail why this is so. The calcula results are shown in Figure 11. The front of the crown forest fire begins to move at a distance of 20 m from the closing structure. The material of construction is plywood. The front speed is set to m/s, the flame height is from 1 m to 10 m. The estimated time is 50 s. The calculation res are shown in Figure 12. The front of the crown forest fire begins to move at a distance of 20 m from the enclosing structure. The material of construction is plywood. The front speed is set to 0.33 m/s, the flame height is from 1 m to 10 m. The estimated time is 50 s. The calculation results are shown in Figure 12. Figure 11. Impact of a surface forest fire (high intensity) on plywood from a distance of 20 mtemperature distribution along the wall thickness.
The front of the crown forest fire begins to move at a distance of 20 m from the enclosing structure. The material of construction is plywood. The front speed is set to 0.33 m/s, the flame height is from 1 m to 10 m. The estimated time is 50 s. The calculation results are shown in Figure 12.  A low-intensity surface forest fire front begins to move at a distance of 20 m from the enclosing structure. The material of construction changes for each calculation. The front speed is set to 0.015 m/s, the flame height is 1 m. The estimated time is 425 s. The calculation results are shown in Figure 13.   A high-intensity surface forest fire front starts to move at a distance of 20 m from the enclosing structure. The material of construction changes for each calculation. The front speed is set at 0.05 m/s, the flame height is 1 m. The estimated time is 350 s. The calculation results are shown in Figure 14.
A high-intensity surface forest fire front starts to move at a distance of 20 m from the enclosing structure. The material of construction changes for each calculation. The front speed is set at 0.05 m/s, the flame height is 1 m. The estimated time is 350 s. The calculation results are shown in Figure 14.  The effect of paint and varnish coatings was found to be small, the temperature difference on the surface was about 2 • C. The data on the absorption coefficients of radiant energy for various paints are given in Table 4 used in civil engineering. Data are given on unpainted wood species, dark gray paint, white and blue paint, and also on a straw-colored surface [62]. The material is considered as a material made of plywood. As a result of numerous computational experiments, similar to [61] patterns of the impact of forest fires on the enclosing structures of a wooden building were obtained. The first group of computational experiments examined the effects of various forest fires on a wall made from unpainted wood materials. As it was established as a result of modeling, the wall heats up mainly at the stage preceding the ignition, and heating occurs in the surface layers of wood with a thickness of about 2 cm.
Temperature distributions in the plywood enclosure were obtained. The results are shown in Figure 10. Although the propagation speed is not high, the surface temperature exceeds 800 • C for an exposure time of 425 s. The results disagree with the results in [61]. This discrepancy can be caused by the feature of rounding numbers in different programming language; the feature of parallel calculation.
A high intensity surface forest fire has a significant effect on surface temperature. After 350 s of exposure, the temperature at the boundary and the heat flux reaches their limit values, and the boundary condition can no longer be calculated. This phenomenon can be associated with the fact that the wood begins to smolder and give off to the environment a heat flux equal to the heat flux from the forest fire front and no further heating occurs. In a crown fire, the critical temperature is reached within one minute of exposure. Critical temperatures are reached in the range of heights from 1 to 10 m. Temperature fields were calculated in various materials of construction. Figure 13 shows the temperature distribution over the depth of the material. The scenario of a low-intensity ground forest fire was considered. The exposure time is 425 s. As can be seen in Figure 13, the maximum heating of the material corresponds to pine wood. The least effect of heat flow is observed for facing cardboard and fiberboard with a density of 1000 kg/m 3 . Temperatures reach critical values, while the falling heat flux is not large. Figure 14 shows the temperature distribution over the depth of the material. A scenario of a high-intensity surface forest fire was considered. The exposure time is 350 s since further recalculation of the boundary conditions does not occur. The temperatures at the border are above critical. In this case, ignition of the structure is inevitable.
A crown forest fire was not considered, since in the event of such a fire developing near the building, the owner can only be saved through evacuation.
Thus, it can be seen that the ignition of the structures of a wooden building occurs in a fairly short exposure time. The computation time of the sequential prediction algorithm is longer than the ignition time of structures under the scenarios presented in this work. The demand for reducing the simulation time is extremely high, otherwise such models will not be of practical importance. Possible ways to reduce the simulation time include a decrease in the resolution of the computational grid, which will cause a significant drop in the simulation accuracy; at sufficiently low resolutions, the temperature data in the near-surface layer can differ several times, which is unacceptable. The second option considered in this paper is distributed computing. With parallel calculations, it is possible to achieve the speed of calculating temperature fields on computational grids with a high resolution comparable to the speed of calculating temperature fields with a low resolution. With a low accuracy of calculating the temperature fields, parallel calculations will not have advantages, but on the contrary will be inferior in speed to a simple synchronous algorithm, since the operating time of each individual process will be less than the calculation time, and a further increase in the calculation processes will increase the operating time of the algorithm presented in the work by value 2n, where n is the number of additional processes involved in the calculation. High-resolution calculations require large amounts of RAM, since it must simultaneously contain full-size matrices for correct calculation in each process. Also, the requirements for the volumes of hard drives, which must be fast enough, are increasing.
The most correct direction for the development of parallel calculations is probably the development of algorithms that in parallel counted several detached buildings with different scenarios of the effect of the heat flux from the forest fire front on the enclosing structures. These algorithms, in conjunction with GIS systems, are able to quickly simulate the impact of a forest fire on entire settlements near the WUI.
It is necessary to check the results obtained in this article in comparison with the previously published data from [61]. Three series of comparative analyzes were carried out. It should be noted that in [61], a three-dimensional formulation is considered, implemented using a sequential programming model, which imposed restrictions on the number of nodes in the computational grid in space and time. In the present article, a two-dimensional formulation is considered, implemented in the SPMD-model of computations using the parallelization of computational operations. The first series completely repeated the conditions for carrying out mathematical modeling in [61], except that in this article a two-dimensional formulation was used. The second series of comparative analysis was carried out for conditions when the reflection of radiation from the wall surface was not taken into account, whereas in [61] this was taken into account. The third series of comparative analysis was carried out for conditions when the penetration of radiation into the surface layer of the cladding was taken into account in this work, similar to the Bouguer-Lambert-Beer law. Several scenarios were considered: Scenario 1. Impact of a low intensity surface forest fire on a glued plywood wall from a distance of 20 m. Scenario 2. Exposure of a high intensity surface forest fire to a glued plywood wall from a distance of 20 m. Scenario 3. Impact of a crown forest fire at different heights on a glued plywood wall from a distance of 20 m.
The results of the comparative analysis are shown in the Table 4. Taking into account the penetration of radiation into the depth of the cladding layer noticeably changes the values of the calculated temperature, both on the surface and in the depth of the cladding layer. Fundamental differences were noted for the scenario of the impact of a low-intensity surface forest fire. A comparative analysis of the results shows that the danger of a low-intensity surface forest fire cannot be underestimated. It is necessary, as with other types of forest fires, to take measures to preserve the lives and property of homeowners. Compared to other forest fires, a low-intensity surface forest fire is characterized by the lowest rate of propagation over a layer of ground forest fuels. This gives homeowners time to evacuate the forest fire area and to rescue documents and valuables.

Conclusions
As a result of the work, an algorithm for the implementation of parallel calculations of heat transfer processes inside a wooden enclosing structure under the influence of thermal radiation from the forest fire front was developed and tested.
The dependencies show similarities with the work [44]. However, they have different numerical values. These discrepancies can be caused by different rounding methods in different programming languages.
The speed of work turned out to be contradictory. On the one hand, there is an increase in productivity, but with an increase in processes over 16, a slowdown in calculation is observed.
Thus, the developed algorithm is of great practical importance. By distributing the load on different processors, the calculation speed of the model is reduced. This makes it possible to apply more complex complex mathematical models and improve the accuracy of the computational grid. It also opens up room for experiments for the simultaneous calculation of problems with different initial conditions and conditions for the flow of heat transfer processes. Further development will make it possible to apply these algorithms when calculating the fire hazard of an entire settlement under various conditions of the impact of a forest fire front on the structure of buildings.
The main advantage of the developed program code is explained by the possibility of applying this code to large areas of research. This article considers a narrow example of the application of the developed code to a simple two-dimensional problem of the impact of a forest fire on a two-layer enclosing structure of an infrastructure facility of Russian Railways. In the next phase of research, the developed program code will be applied to a two-dimensional research area representing an entire street of a railway station, which is approaching a forest fire front. At the third stage of research, remote sensing data on a specific infrastructure facility of Russian Railways in the Republic of Buryatia (Russian Federation) will be connected. Retrospective data from Landsat and Sentinel 2A satellites will be used.