Currently, the most effective constructions of low-discrepancy point sets and sequences are based on the theory of (t, m, s)-nets and (t, s)-sequences. In this work we discuss parallelization techniques for quasi-Monte Carlo integration using (t, s)-sequences. We show that leapfrog parallelization may be very dangerous whereas block-based parallelization turns out to be robust.