Q. Design a concurrent hash table with as much as concurrency as possible.
System has multiple readers and writers. System will crash if a reader or
writer is reading or writing from a location which is being updated by some
writer. We need to prevent crash.
It is pretty much an open-ended
open addressing with fairness : going up on even collision and going down
on odd collision.
On Thu, Aug 11, 2011 at 3:45 PM, Navneet Gupta navneetn...@gmail.comwrote:
Q. Design a concurrent hash table with as much as concurrency as possible.
System has multiple readers and writers. System