language agnostic - Is there an existing solution to the multithreaded data structure problem? -


I need a multi-threaded data structure that supports these claims:

    < Li> allows multiple concurrent readers and authors
  • sorted
  • It's easy to think about

Completing many readers And a writer is very easy, but I did not really want to allow many authors.

I am researching this area, and I know about the Concurrent Escope List (Leader based on work by Fraser and Harris) because it has been implemented in Java SE 6. I have implemented my own too.

These two implementations have been developed by people who are smart for a light year, but I am still (somewhat embarrassed because it is amazing work) The question to ask is whether are these two practical practical implementations of concurrent multi-readers / author data structures available today?

For me it seems that making this problem very difficult for you, consider the following:

  • Applying many data structures, especially the unchanging versions of trees is very easy. The advantage of irreversible data structures is that, due to being irreversible, one thread can not modify the collection under the second thread nose. Immune = no race conditions = no lock = no deadlock.

  • Thrax can 'do'

    See the changes in an irreversible data structure created in another thread. However, they can clearly communicate changes to each other using the message sent concurrency.

Lock and Mutex are very low levels, and instability state is too much enemy Multithreaded programming If you think of any problem you have to solve in the case of instability and passing message If you are trying, it will be 1000x easier for you.


Comments

Popular posts from this blog

c# - How to capture HTTP packet with SharpPcap -

php - Multiple Select with Explode: only returns the word "Array" -

jquery - SimpleModal Confirm fails to submit form -