In this paper a parallel algorithm of the block diagonal pivoting method is given. The method of decomposing symmetric matrice is shown to be stab1e and the method is implemented on parallel computer. Computing result shows the parallel algorithm is ten times faster than the seria1 algorithm when n is greater than 100.