If the big O notation for an algorithm is O(N) and there are P processors over which the algorithm can be parallelized, then the big O notation for this algorithm will now be O(N/P). This assumes that the algorithm can be perfectly parallelized. If not, then the big O needs to be independently determined for each algorithm in terms of components that can and cannot be parallelized.