In the slide deck 'ConcurrentCachingAtGoogle', there is mention JDK8's implementation of ConcurrentHashMap no longer using a segmented hash table.
I assume the "segments" are the top level partitioning that the old implementation used to do.
What does the new implementation do, and how does it perform relative to JDK7's, when it comes to growing the table?
Also, any insights into what factors (in addition to memory footprint of empty instances) drove the change would be most welcome.