Hey guys, some time ago I started a new small pooled (or unpooled), partitioned storage implementation for using with ByteBuffer (Direct, Heap) and Unsafe. It has different selection algorithms for free partitions / slices (a partition buffer is sliced into smaller parts). Currently there is a simple RoundRobin selector, one with ThreadLocal allocation (very similar to the TLAB in the JVM) and one which uses the id of the currently thread executing cpu core (ProcessorLocal) which uses OS api (available on Windows / Linux).
It features a rich SPI to plug in your own selector / partition / slice implementations so that many parts are easily extendable. Maybe we could use some ideas or the storage engine as the backend engine in DirectMemory. But as always I'm happy about any comments or suggestions on the implementation. At the moment a lot of documentation / Javadoc is missing but maybe someone will have a look into it. https://github.com/noctarius/direct-ring-cache Chris / Noc
