The shortest time of the minimum eigenvalue of ［N,k］ of Heisenberg model (N is the total number of sites of Heisenberg chain , k is the number of electrons at site spin up) were obtained using parallel algorithm (Z equisection method, Z is from 1 to a, a is the number of the eigenvalue of ［N,k］) in Fortran program. The energy matrix of ［N,k］ was produced by permutation group. The eigenvalues were obtained by diagonalling the energy matrix. The shortest (or longest) time of the minimum eigenvalue of ［N,k］ was obtained from the data group being made up of the eigenvalues using Z equisection method. The results show that the time is the shortest and same when Z is 1 or the number of the eigenvalue of ［N,k］. When N(k) are same, k(N) increases and Z is same, the time acquisiting the minimum eigenvalue of ［N,k］ increases.