Category: In-Memory Data Grid

This category contains posts concerning the configuration, maintenance, and optimization of In-Memory Data Grids.

Priority Queueing Using the SPI

Hazelcast provides distributed queues, an implementation of java.util.concurrent.BlockingQueue. However, an implementation of java.util.concurrent.PriorityBlockingQueue is not yet provided. In this example, we’ll see how to write this yourself, using Hazelcast’s SPI (Service Provider Interface). (Note: this is just an example, deliberately…

Hazelcast IMDG 3.9 Is Out!

We just released Hazelcast IMDG 3.9. It’s a release packed with new features, improvements and optimizations. Let me introduce you to a few of them: User Code Deployment from Clients In Hazelcast IMDG 3.8, we introduced an option for automatic…

Jepsen Analysis on Hazelcast 3.8.3

Jepsen Analysis Kyle Kingsbury (aka @aphyr) has prepared an analysis of Hazelcast IMDG 3.8.3 using his Jepsen tool, as he has many other distributed systems over the last four years. We are the first In-Memory Data Grid (IMDG) to be…

Tricolor: Multiple classloaders, multiple Hazelcasts, multiple loggers and multiple colours — all in the one JVM

Why? The normal deployment is for a JVM to contain a single Hazelcast instance, a client or a server. This means that the instance can utilise all the resources available to that JVM. In automated tests, it can frequently be…

Hazelcast IMDG 3.8 EA is Out

I am excited to introduce Hazelcast IMDG 3.8 Early Access. It is “Early Access”, we do not recommend using this in production because we have not tested it intensely yet. You can however use it in your development phase in…

Hazelcast Discovery SPI

Your Perception of the Network Service Discovery or Network Exploration Eureka, Zookeeper, Consul and others, Service Discovery is an integral part of almost all of the new elastically scaling software systems. Instances or nodes of the application space can come,…