The Continued Fractions version of Vincent’s theorem of 1836, is the basis of the fastest method for the isolation of the positive roots of a polynomial equation using straight line (serial) computations. However, this version cannot be parallelized, and so we resorted to the bisection version of Vincent’s theorem due to Alesina and Galuzzi (2000). The bisection version behaves poorly in straight line programming, but shows great potential in parallel programming. In this talk we will present our experimental results which we obtained on cluster in JSCC RAS.