Concurrent Hash Table
A Concurrency (computer science), concurrent hash table or concurrent hash map is an implementation of hash tables allowing Concurrency (computer science), concurrent access by multiple Thread (computing), threads using a hash function. Concurrent hash tables represent a key concurrent data structure for use in concurrent computing which allow multiple threads to more efficiently cooperate for a computation among shared data. Due to the natural problems associated with concurrent access - namely Resource contention, contention - the way and scope in which the table can be concurrently accessed differs depending on the implementation. Furthermore, the resulting speed up might not be linear with the amount of threads used as contention needs to be resolved, producing processing Overhead (computing), overhead. There exist multiple solutions to mitigate the effects of contention, that each preserve the Correctness (computer science), correctness of operations on the table. As with ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]