Thanks for the answers. For now I went with taking most significant bits of java UUID and computing modulus value of it. I created the test to see how this scheme behaves in terms of distribution and for now it is good enough for me.
I have one more question. Assuming I will do something like in the docs (uuidValue % someNumber). someNumber determines the number of shards. This means that I can have up to someNumber nodes in my cluster - any node that will exceed someNumber will not be used because someNumber is too small. It is some limitation in terms of scalability. I am wondering if someone tried to use some other scheme that would allow some flexibility in terms of number of nodes - for example when we will have as many nodes as someNumber the scheme will somehow change itself to be aware of increased number of nodes? -- >>>>>>>>>> Read the docs: http://akka.io/docs/ >>>>>>>>>> Check the FAQ: >>>>>>>>>> http://doc.akka.io/docs/akka/current/additional/faq.html >>>>>>>>>> Search the archives: https://groups.google.com/group/akka-user --- You received this message because you are subscribed to the Google Groups "Akka User List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/akka-user. For more options, visit https://groups.google.com/d/optout.
