Irregular iteration parallelization method

Abstract

The invention relates to an irregular iteration parallelization method. In the initializing stage, the data locality property and the data parallelism of irregular iteration calculation are enhanced by analyzing an access mode of data according to a generation strategy of a data block and a sub data block; in the executing stage, the data locality property and the data parallelism of an irregular iteration technology are enhanced by executing a new generated scheduling strategy and a converted code; and in an actual executing process, an automatic performance optimizer of the irregular iteration calculation method is created, a parameter value combination under the condition of optimal efficiency is found out by an exhaustion detecting method and the parameter values of the parameter value combination are fixed, and the optimal running efficiency under the system architecture can be realized. The method is good in parallelization efficiency and expandability.

Description

An Irregular Iterative Parallelization Method technical field The invention belongs to the field of oil reservoir numerical simulation and relates to an irregular iterative parallelization method. Background technique In reservoir numerical simulation, after finite element analysis, the physical area is discretized into irregular grids, and the problem of solving variables such as pressure of each grid is finally attributed to the use of successive over-relaxation (SOR) or Gauss-Seidel ( GS) and other iterative algorithms to efficiently solve problems of large sparse linear equations. The pressure equation in reservoir numerical simulation is represented by , where represents the pressure unknown vector, represents the large sparse coefficient matrix, and represents the constant vector. In the field of reservoir numerical simulation, the non-zero elements in a large sparse coefficient matrix usually occupy less than the total matrix capacity, and the storage space and cal...

AI Technical Summary

Problems solved by technology

The non-regular iterative calculation problem cannot determine the data array subscript of the sparse coefficient matrix at compile time, so the previous research methods are not applicable to this type of problem

Images