50 ms·
What helped me understand was this point concurrency is a property of the algorithm, parallelism is a property of the execution environment To expand on the a
by rdtsc 13y ago
What helped me understand was this point
concurrency is a property of the algorithm, parallelism is a property of the execution environment
To expand on the above. This means that a particular problem can be talked about in terms of smaller sub problems. Example, you are serving a site. Sub problems are handling each client request. Another example of problem "crack password via brute-force method", sub problem is "try one particular password". Here is where discussion comes about whether there are concurrent sub-problems or not. We are not sure about how they'll run yet.
>For example, are parallel processes always concurrent?
Not sure what you mean by that. Are these processes solving one particular problem. Concurrency and parallelism make sense for a particular problem or algorithm. How are these processes related? Do they just happen to run on the same machine but otherwise are solving separate problems. Then maybe it doesn't even make sense to talk about either concurrency or parallelism.
Now you can turn this on its head an look at it from the point of view of a kernel designer. His very simplified algorithm is "fairly schedule processes and IO" for all the users. So his problem now deals with any two processes but these are now all part of a problem.
I guess I am trying to say that some questions just don't make sense to ask.