Multithreading is tough. The only thing you can do is program very carefully and follow good tips. One great piece of advice I received from the answers on this forum is to avoid a volatile state . I understand that this even applies in Erlang language. However, I do not see how this can be done without serious performance gains and a huge amount of caches.
For example. You have a large list of objects, each of which contains quite a few properties; in other words: a large data structure. Suppose you have a bunch of threads and they all need to access and modify the list. How can this be done without shared memory without caching the entire data structure in each thread?
Update: After reading these reactions, I would like to pay attention to performance. Don't you think that copying the same data will make the program slower than with shared memory?
source
share