c++ - Lock-free map or hash table or ...? -


multiple producers - 1 consumer. producers write tagged(uint64) values, consumer reads 1 one. consumer must read last value same tag.

now have simple lock-free queue. thus, consumer must check entire queue last added value same tag.

i want replace queue hashtable , write new values instead of old same tag. how should reader it? should remove last value hash-table or should reduce input queue achieve 1 tag hashtable buffer or ...?

also, advise me pls c++ libs, have lock-free hashtable implementation, coz boost doesnt.


Comments

Popular posts from this blog

apache - Remove .php and add trailing slash in url using htaccess not loading css -

javascript - jQuery show full size image on click -