Start with bihash and see how much serialization you encounter in practice. If your use case will write the hash table anywhere near as often as it reads the hash table, I wouldn’t think that’s a good sign...
D. From: vpp-dev@lists.fd.io <vpp-dev@lists.fd.io> On Behalf Of krishnamurthy.m...@gmail.com Sent: Friday, September 27, 2019 5:18 PM To: vpp-dev@lists.fd.io Subject: [vpp-dev] Implementation of a hash table that can be both written and read by all VPP workers #vpp Hi, We have a use case that requires us to implement a hash table with multi-thread support. In our use case all VPP workers can add/remove/access (i.e. write and read) entries to/from this hash table. I looked at the VPP Bihash implementation that has the property of not requiring reader locks. Ideally I would like to take a writer lock only when multiple writers are trying to update the same bucket. If anyone is aware of any such implementation in the Fd.Io code base, could you please point me to it so that I can use it as an example? Best Regards, Krishna
-=-=-=-=-=-=-=-=-=-=-=- Links: You receive all messages sent to this group. View/Reply Online (#14079): https://lists.fd.io/g/vpp-dev/message/14079 Mute This Topic: https://lists.fd.io/mt/34316400/21656 Mute #vpp: https://lists.fd.io/mk?hashtag=vpp&subid=1480452 Group Owner: vpp-dev+ow...@lists.fd.io Unsubscribe: https://lists.fd.io/g/vpp-dev/unsub [arch...@mail-archive.com] -=-=-=-=-=-=-=-=-=-=-=-
