Java In-memory Distributed Linked List

Question

I have a requirement to have data In memory and distributed across nodes, I could see Hazelcast and Apache Ignite support JCache and Key value pairs. But distributed by its own algo (like Hashing)

My requirement is data(element) should be sorted by timestamp(One of the fields in the Java Data object) and partitioned in Heap as a List (like Distributed Linked List)

Ex: Let's say we have 4 Nodes.

List 1 on Node 1 -> element(1), element(2), element(3). 
List 2 on Node 2 -> element(4), element(5), element(6).
List 3 on Node 3 -> element(7), element(8), element(9).
List 4 on Node 4 -> element(10), element(11), element(12). ```

element (n) transaction time < element (n+1) transaction time 

The goal is to run Algo in memory on each node on the local data without network call.  

Answer 1

For Hazelcast, you probably want near-cache.

This lets the system distribute the data the way it should, but each node can keep a local copy of the data it is using.

You can override the distribution algorithm if you wish certain pieces of data to be kept together. However, trying to control where that is stops a distributed system from rebalancing the data to even out load.

Answer 2

In addition to Neil's near-cache advice, you should also look into the Distributed Computing section within the Finding the Right tool chapter in Hazelcast documentation. There are 3 ways to proceed:

• Hazelcast Jet stream & batch engine - your pipelines (jobs) can also process data locally;
• ExecutorService - allows you to execute your code on cluster members;
• EntryProcessor - allows your code to process IMap entries locally on members.