It entirely depends on the implementation details of the underlying data store, and I don't know enough about perls' hash low level implementation to comment. However, separating read locks from write locks might be useful. RCU does it that way, so reading up on how it works may give you some ideas. RCU is optimized for the read case and so writes can be very slow.
In reply to Re: Design thoughts: iterator invalidation
by RichardK
in thread Design thoughts: iterator invalidation
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |