HRMS (Hybrid Remapping Mark Sweep) is my second attempt for a high throughput low latency GC for the Java (OpenJDK).
HRMS works by partitioning the heap into pages.
Each page is currently two mega-byte large.
Furthermore it reserves a vast amount of virtual address space.
Having a vast virtual address space reduces the frequency of required heap compactions thus eliminating unnecessary memory modifications.
It then uses standard POSIX API calls (shared memory) to map these pages into the reserved virtual address space.
It furthermore employs coalescing reference counting for small, non-array objects residing in the old generation making it both a reference counting and tracing collector.
To come soon
It is assumed that you use a vanilla Debian 7 (AMD64) base system
(with as many CPU cores as you can get your hands on).
Download to follow soon.