We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algorithms for determining canonical forms of matrices over various computational domains. Our implementations take advantage of wellperforming sequential code and give very good performance.