Lattice Quantum Chromodynamics (QCD) is a non-perturbative method for solving QCD based on the first principles. By simulating the interaction between gluon field and fermion field on super-cubic lattice, the calculated results are considered to be a reliable description of the phenomenon of strong interaction. Lattice calculation is of great significance to the study of QCD theory. However, the lattice QCD computing has a very large degree of freedom, which makes it difficult to improve the computational efficiency. Usually, the domain decomposition method is used to realize the scalability of parallel computing, but how to improve the efficiency of data parallel computing is still the core problem. In this work, taking Grid, a typical lattice QCD software, as an example, the data parallel computing pattern in lattice QCD computing is studied. Focusing on the complex tensor computing in lattice QCD and improving the efficiency of large-scale parallel computing, the theoretical analysis of data parallel computing features in lattice QCD method is carried out, and then the performance test and analysis are carried out for the specific data parallel computing methods such as SIMD and OpenMP of Grid software. Finally, the significance of data parallel computing pattern to the application of lattice QCD computing is explained.