but, in my case, I have to implement a queue (first in first out) and guarantee that any data must not lose. If one data lose, the system is very critical.
I don't think Infinispan is the right tool for the job here, sounds to me like what you need is an JMS impl, have you conidered using one instead? E.g. HornetQ
I couldn't use numOwner as 2. because infinispan can't distinguish original and replicated entry and the listener of nodes where data enter invoke 2 times with same key.
( so business process called twice and it's duplicated),.
you could, and in the listener verify the key and identify the primary owner, e.g. cache.getAdvancedCache().getDistributionManager().getPrimaryLocation(key).equals(cache.getAdvancedCache().getRpcManager().getAddress()) -> if this condition is true execute your logic, otherwise ignore the event (this condition is true on the main data owner only)
I'm not sure what your question is though... :-)
Hi, I'm prototyping FIFO Queue using infinispan.
It's make a linked-list only Key/Value.
You can check it following URLs, but, some contents are korean language.
- Infinispan Queue Slide http://www.slideshare.net/opennaru/20130226-infinispan-queue
- Source Github https://github.com/nameislocus/infinispan-queue/