网络 并发哈希图
We will look at the implementation details of ConcurrentHashMap in next month´s article.
在下个月的文章中,我们将看看ConcurrentHashMap的实现的细节。
Table 1 gives a rough idea of the scalability differences between Hashtable and ConcurrentHashMap.
表1对Hashtable和ConcurrentHashMap的可伸缩性进行了粗略的比较。
ConcurrentHashMap achieves higher concurrency by slightly relaxing the promises it makes to callers.
ConcurrentHashMap通过稍微地松弛它对调用者的承诺而获得了更高的并发性。
This grouping of locks helps programmers identity which ConcurrentHashMap object has the most serious JUC lock contentions.
这样的对锁的分组能够帮助程序员发现哪一个ConcurrentHashMap对象发生了最严重的锁竞争。
ConcurrentHashMap is designed to optimize retrieval operations; in fact, successful get operations usually succeed with no locking at all.
ConcurrentHashMap被设计用来优化检索操作;实际上,成功的get操作完成之后通常根本不会有锁着的资源。