There is produced  a parallelization of a symbolic method for solving systems of partial differential equations by means of Laplace--Carson transform.  An algorithm includes a proceeder to obtain compatibility conditions for initial data. The following  allows to consider parallelization efficient for Laplace-Carson  method (LC).    

Preparation for symbolic implementation of the method consists of  expansion of input functions into series or sums of exponents with polynomial coefficients for LC;   expansion of solution of algebraic  system into partial fractions in the whole or at each step of multivariate integration for the inverse LC. Each procedure from this list permit  parallel performance at various levels.  LC  for each input function  and  inverse LC for algebraic solutions may be performed parallel. There exist  efficient parallel algorithms for solving  the algebraic linear system with polynomial coefficients -- the LC  image of the data system of  partial differential equations.