Distributed Data Structures in Java

Question

I am going to develop my own implementation of a message queue in Java, and I need to distribute the contents of the queue on several servers to ensure reliability and redundancy.

In addition to this, I need to save the contents of the queue to the file system.

Can someone tell me what is the most suitable implementation of a distributed data structure for storing my queue content?

Note. . This data structure should provide me with a means to organize my messages. This means that I need to receive messages according to orders. In addition, when reading a message, it must be in the “locked” state so that other consumers cannot read it until the first consumer completes the reading process.

Answer 1

Have you looked at any of the existing existing message queue implementations for java? Wikipedia lists many open source implementations. It seems to me that an existing, carefully checked message queue is the best place to store the contents of the queue :)

If you absolutely want to write your own, then starting with the open source solution that best suits your needs will probably answer most of your questions about which data structures work well.