- Here is finally what i want to say - 1 Update
- cmsg cancel <mecu0i$no9$2@dont-email.me> - 2 Updates
- More about concurrent datastructures - 1 Update
| Ramine <ramine@1.1>: Mar 18 06:54PM -0700 Hello, Here is finally what i want to say... I have seen many researchers inventing concurrent datastructures such as AVL trees and Red-Black trees and Skiplists.. and i have seen them speaking about there good scalability... but if you read my previous posts, there is still a big problem ! since you can not avoid contention on NUMA nodes when using those concurrent datastructures, so, like in realtime systems, you CAN NOT guaranty a throughput of a certain good "speed", and this also a criterion that is very important, and since you can not guaranty a good speed , this is not what we call good "quality" or good scalability. Thank you, Amine Moulay Ramdane. |
| bleachbot <bleachbot@httrack.com>: Mar 18 11:26PM +0100 |
| bleachbot <bleachbot@httrack.com>: Mar 18 11:46PM +0100 |
| Ramine <ramine@1.1>: Mar 18 06:33PM -0700 Hello, In this post i will speak about a very important subject... In my previous posts i have spook about my scalable SeqlockX and spook about Transactional memory that are optimistic synchronisation mechanisms, and i have also spook about scalable distributed reader-writer lock.. and you have seen explaining to you important subjects.. hope you have understood my previous posts, but there is still a big problem ! when you use concurrent AVL trees or other concurrent datastructures that look like concurrent AVL trees you have to allocate memory for the "nodes" of your AVL tree, those memory nodes must be accessed when we do a search() in for example a time complexity of log(n), but to be able to scale the concurrent AVL tree you have to allocate those memory nodes on different NUMA nodes , but here comes the problem, when you will use those NUMA nodes on a concurrent AVL tree you can not always get a good scalability on those NUMA nodes because accessing the concurrent AVL tree it is like a probabilistic mechanism , i mean you can still get "contention" on NUMA nodes, and since you still can get contention that's not what we call a good scalability, and this is what i wanted to explain. Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment