Solving zeros in a polynomial equation is significant both in theory and in practice. It is widely used not only in applied mathematics but also in many fields such as engineering sciences, physics, computer science, astronomy, finance, and so on. In this paper, a family of parallel iterative methods to simultaneously determine all roots of a polynomial equation is proposed. The new method is an one-parameter family of simultaneous methods to determine all distinct zeros of a polynomial, which is obtained by applying a family of third-order modified Chebyshev’s methods to correct the Ehrlich-Aberth method. It is proved that the proposed method is locally convergent of fifth order. Some numerical results are presented to show that the new method is more e?cient than some commonly used methods.