Parallel Computing Applied to Breeding Value Estimation in Dairy Cattle

Abstract

Continuous genetic evaluation of dairy cattle with test-day models is desired in Finland. However, the computing time for the genetic evaluation is 4 d and exceeds the minimum of a weekend. Three parallel implementations of the preconditioned conjugate gradient iterative solver were programmed and compared to identify the best strategy for solving mixed model equations using parallel computing. The programs were used to solve two random regression test-day models with approximately 7.28 and 49.9million unknowns. The latter model will be used in the Finnish dairy cattle evaluation. Computing times for the smaller model with the four processors available were 52, 32, and 27% of the single processor program when the complexity of the parallel program was increased. In practice, the best program required the most programming because the other parallel programs could not solve the larger model because of excess memory requirements. Parallel computing with four processors reduced the time to obtain solutions of Finnish dairy cattle evaluations to under 2 d. Benefit from parallel computing will be increased if amount of computing memory is increased.