https://github.com/elliottneilclark/benchmark-hbase-cache
tl;dr hbase friends found that using a COW-Map implementation was a good fit for performance (over Concurrent* data structures).
A glance shows us primarily doing a RWLock with a plain-jane TreeMap. Would be a neat experiment to repro (perhaps after measuring how much time we actually spend doing tablet loc lookups)
