Abstract. We present an attempt to estimate the quality of the parallelization of the minimal involutive bases construction algorithm. The problem of the possibility to parallelize the algorithm is very important because of a big computational complexity. The estimation of the quality of the parallelization of the minimal involutive bases construction algorithm, presented in this paper, was never published before. It is shown that the minimal involutive basis algorithm is very sequential like the Gröbner basis construction algorithm.