RFR: 8312132: Add tracking of multiple address spaces in NMT [v54]

[Johan Sjölen]

On Tue, 30 Apr 2024 17:44:59 GMT, Thomas Stuefe <stuefe at openjdk.org> wrote:

>If I am not mistaken, it also seems more expensive? A remove node needs two splits and a merge, both seem to be dependent on tree depth. Removing the node via find-and-rotate-til-its-a-leaf only needs one tree traversal (first find the node, then rotate down until its a leaf).

It is more expensive AFAICS. Remove with split/merge needs three passes down the tree, remove with rotation needs a pass down the tree and then a pass up the tree. So 3*log(n) vs 2*log(n) ;-).

-------------

PR Comment: https://git.openjdk.org/jdk/pull/18289#issuecomment-2094697902