"A fortiori", the corresponding decision problem belongs to the class P of problems solvable in polynomial time.The GCD problem is not known to be in NC, and so there is no known way to parallelize it efficiently; nor is it known to be P-complete, which would imply that it is unlikely to be possible to efficiently parallelize GCD computation.