On Fri, Aug 28, 2009 at 2:47 PM, Pharaoh .<[email protected]> wrote:
> How about RCU mechanism? > > I think using this I can design an efficient concurrently accessible rb > tree. > Any thoughts? IMO, in your case, since you need to implement tree structure and as lockless as possible, RCU *could* be the answer. Or perhaps somekind of mixed RCU and per CPU data i.e copy most read data to per CPU variable and push it back to the related node of the tree when the modification is done. Just a thought... Whether it really suits your need or not, it entirely depends on your own specification and requirement -- regards, Mulyadi Santosa Freelance Linux trainer blog: the-hydra.blogspot.com -- To unsubscribe from this list: send an email with "unsubscribe kernelnewbies" to [email protected] Please read the FAQ at http://kernelnewbies.org/FAQ
