JDK-8195098 : Low latency hashtable for read-mostly scenarios
  • Type: Sub-task
  • Component: hotspot
  • Sub-Component: runtime
  • Affected Version: 11
  • Priority: P4
  • Status: Resolved
  • Resolution: Fixed
  • Submitted: 2018-01-15
  • Updated: 2020-10-26
  • Resolved: 2018-05-17
The Version table provides details related to the release that this issue/RFE will be addressed.

Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.

To download the current JDK release, click here.
JDK 11
11 b15Fixed
Related Reports
Relates :  
Description
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.
Comments
URL: http://hg.openjdk.java.net/jdk/jdk/rev/8e4fcfb4cfe4 User: rehn Date: 2018-05-17 08:34:19 +0000
17-05-2018