This paper discusses the parallel information-based complexity of numerical integrations on the Sobolev class \(W^s_q(\Omega)\). Meanwhile, sharp bounds of the complexity are given, in which the number of the processors and the required precision are considered as two variables.