Laptop MacBook Pro Processor 2.2 GHz Intel Core i7 Memory 16GB 1600 MHz DDR3 Storage 106 GB free of 250 GB Graphics Intel Iris Pro 1546 MB
for (int i = 0; i < message_number; i += batch_size) {Otherwise the number of messages actually written was message_number * batch_size.
--
You received this message because you are subscribed to the Google Groups "Chronicle" group.
To unsubscribe from this group and stop receiving emails from it, send an email to java-chronicl...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
Chronicle Queue supports HA via replication. This is a simple implementation but it can be suitable for some use cases.
Agreed, which is why when I compare with alternative solutions I try to point out that I am not the best person to optimise any other solution.
Also the choice of test will suit different solutions. As we work in the low latency space, you want a batch size of 1 as much as possible and not surprisingly we do well for this use case as that is what we optimised for. Batches of larger than 1 mean delaying some of the messages so you can build a batch rather sending them as soon as they arrive.
Being low latency can suit the reactive space better whereas large batches can suit the traditional transactional space better.
Regards, Peter.