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 <[email protected]>wrote: > 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 question, so basically looking for > strategies. > > -- > Regards, > Navneet > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- ........................ *MOHIT VERMA* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
