brianm / gressilLinks
Safe daemonization from within Java
☆74Updated 7 years ago
Alternatives and similar repositories for gressil
Users that are interested in gressil are comparing it to the libraries listed below
Sorting:
- ☆59Updated 10 years ago
- A variable length record, checksumming, append only rotating log implementation with graceful recovery☆54Updated 4 years ago
- Drop-in replacement for java.util.concurrent.ConcurrentSkipList[Map|Set]☆29Updated 15 years ago
- Library for creating In-memory circular buffers that use direct ByteBuffers to minimize GC overhead☆137Updated 3 years ago
- DDSL - Dynamic Distributed Service Locator☆102Updated 9 years ago
- A hash-based high-performance data store☆161Updated last year
- A variable length record, checksumming, append only rotating log implementation with graceful recovery☆14Updated 13 years ago
- Utilities for dealing with Apache Zookeeper☆41Updated 11 years ago
- Then comes thunder.☆22Updated 9 years ago
- ☆142Updated 3 years ago
- Distributed Java Collections for ZooKeeper☆110Updated 8 years ago
- Container caplet☆35Updated 9 years ago
- Offheap Java POJOs with guaranteed memory alignment☆188Updated 11 years ago
- High performance, memory-limited adaptive histogram class.☆46Updated 6 years ago
- ☆33Updated 6 years ago
- Embeddable daemonization library☆133Updated 4 years ago
- Utilities for HDR Histogram logs manipulation☆30Updated 4 years ago
- Examples of using Akka and 0MQ in Java, separately and together.☆50Updated 14 years ago
- Bloofi: A java implementation of multidimensional Bloom filters☆79Updated 9 years ago
- Virtual Time for the JVM☆62Updated 6 years ago
- An ORM for people who hate ORMs.☆49Updated 8 years ago
- hp low latency reliable multicast messaging☆122Updated 9 years ago
- In-process in-memory multi-level LRU cache☆21Updated 3 years ago
- Journal.IO is a zero-dependency, fast and easy-to-use journal storage implementation.☆260Updated 2 years ago
- jRT measures the response time of a java application to socket-based requests☆49Updated 8 years ago
- A very memory-efficient trie (radix tree) implementation