4 ms·
Has anyone looked at lock-free data structures and algorithms in projects with large amounts of concurrency? The approach looks promising but it's unclear how p
by akg 15y ago
Has anyone looked at lock-free data structures and algorithms in projects with large amounts of concurrency? The approach looks promising but it's unclear how practical it is.
- duggan 15y agoI think for tackling a subset of these problems (well, circumventing them) ZeroMQ is generating a good deal of interest. http://www.zeromq.org http://www.zeromq.org http://www.zeromq.org/blog:multithreading-magic http://www.zeromq.org/blog:multithreading-magic
- plainOldText 15y agoI was thinking about the same thing. My view is: building applications on top of heterogeneous nodes (in the cloud) and then coupling them all together via ZeroMQ.
- LearnYouALisp 15y agoIs this related to sacrificing numerical accuracy for more operations per second? That sounds like a good idea for some things.
- queensnake 15y agoNo, (http://en.wikipedia.org/wiki/Lock-free http://en.wikipedia.org/wiki/Lock-free) it's using different data structures and algorithms and new-to-C++ (or the applicable assemblies), really low-level operations /to avoid locking at all/. (To avoid threads blocking, not the overhead of the locks themselves.)