Hazelcast – Common Pitfalls & Performance Tips
Hazelcast Queue on single machine Hazelcast queues are stored on a single member (along with a backup on different machines). This effectively means the queue can hold as many items…
Hazelcast Queue on single machine Hazelcast queues are stored on a single member (along with a backup on different machines). This effectively means the queue can hold as many items…
Hazelcast supports the addition of listeners when a given collection, for example, queue, set, list, etc. is updated. Typical events include entry added an entry removed. Let's see how to…
MapReduce is a computation model which is useful for data processing when you have lots of data and you need multiple machines, i.e., a distributed environment to calculate data. It…
Hazelcast provides multiple ways to monitor the cluster. We will look into how to monitor via REST API and via JMX. Let's first look into REST API. Monitoring Hazelcast via…
Hazelcast supports an easy way to integrate with the Spring Boot application. Let's try to understand that via an example. We will create a simple API application that provides an…
Hazelcast is ideally used in an environment where data/query are distributed across machines. This requires data to be serialized from our Java objects to a byte array which can be…
Hazelcast clients are the lightweight clients to Hazelcast members. Hazelcast members are responsible to store data and the partitions. They act as the server in the traditional client-server model. Hazelcast…
The java.util.concurrent.The map provides an interface that supports storing key-value pairs in a single JVM. While java.util.concurrent.ConcurrentMap extends this to support thread safety in a single JVM with multiple threads.…
The java.util.concurrent.BlockingQueue provides an interface that supports threads in a JVM to produce and consume messages at different rates. The producer blocks are based on available capacity and the consumer…
The java.util.List provides an interface for holding collections of objects that do not necessarily need to be unique. The ordering of elements does not matter. Similarly, IList implements a distributed…