A problem is either parallelizable to a degree or not. Assuming a (Theoretical) shared memory computer with N CPUs, there are still problems which you won't be able to parallelize.
The question of how that problem behaves on a message passing system vs a shared memory system comes afterwards..
''non-parallelizable problems''
..
What does that have to do with anything ?
A problem is either parallelizable to a degree or not. Assuming a (Theoretical) shared memory computer with N CPUs, there are still problems which you won't be able to parallelize.
The question of how that problem behaves on a message passing system vs a shared memory system comes afterwards