Am 04.04.2013 23:39, schrieb Jan Kotek: > Last commit is 2 months old, and not much has happened since Christmas. > > If I may respectfully suggest, why not implement direct-memory on top of > MapDB? It already does pretty well what DM aims for (off-heap cache) and it > recently graduated into stable release. Also MapDB could use some Unsafe > storage and serialization.
Isn't MapDB not very similar to what DM is? > > BTW Chris: WAL storage rewrite is finished. Now it supports parallel writes > into underlying ByteBuffer. Ah cool, I'll have a look at it. Maybe I'll "steeling" one or another idea ;-) > Regards, > Jan Kotek > > > On Thursday 04 April 2013 21:56:41 Christoph Engelbert wrote: >> Is the DM development fallen asleep? Would be bad because it has the >> potential to be a good competitor to BigMemory or ElasticMemory. >> >> Chris >> >> Am 02.04.2013 21:30, schrieb Christoph Engelbert: >>> 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
