On the Parallel Complexity of Matrix Factorization Algorithms