| Issue | Fix Version | Assignee | Priority | Status | Resolution | Resolved In Build | 
|---|---|---|---|---|---|---|
| JDK-8203965 | 11.0.1 | Robbin Ehn | P4 | Resolved | Fixed | team | 
                    The much lower latency of the new gcs have higher demands on runtime data-structure in terms of latency.
We must create new data-structures to accommodate this and apply them on latency sensitive data-set.
The hashtable should be able to do all operation with little serialization between threads.
A highly concurrent hashtable will require a way to handle ABA without locks, such as hazardpointers, RCU, type-stable-memory.
We must create new data-structures to accommodate this and apply them on latency sensitive data-set.
The hashtable should be able to do all operation with little serialization between threads.
A highly concurrent hashtable will require a way to handle ABA without locks, such as hazardpointers, RCU, type-stable-memory.
- backported by
 - 
                    
JDK-8203965 Low latency hashtable for read-mostly scenarios
-         
     - Resolved
 
 -         
 
- relates to
 - 
                    
JDK-8255389 ConcurrentHashTable::NoOp omits return in non-void return method
-         
     - Resolved
 
 -