I think jgroups[1] might be the best fit here [1] http://jgroups.org
On 14-Apr-2011 3:53 AM, "Semih Salihoglu" <[email protected]> wrote: Hi All, I apologize in advance that this is not a question specific to MINA and I realize I'm violating the rules for sending this community an email but I think this community could point me to the right place at least. I am working on a distributed system that does some graph computation (mostly running various dfs or bfs based algorithms, pagerank, etc..) in which multiple machines keep sending each other messages continuously throughout the duration of the algorithm. For those of you who might be familiar with it, it's like Pregel< http://delivery.acm.org/10.1145/1810000/1807184/p135-malewicz.pdf?key1=1807184&key2=4213372031&coll=DL&dl=ACM&ip=171.64.75.59&CFID=16207504&CFTOKEN=47516376 >, the bulk synchronous graph computation system at Google. My cluster has 20 machines and each machine sends/receives messages from every other machine. I am looking for a library that will optimize how often, in how many batches and how many receiving/sending threads this should be done. I ran into MINA when I was looking at the Apache website. I looked at a few presentations and examples and it seemed to me that it was mainly for server/client applications that answer multiple requests (maybe short lived). In most of the algorithms that I'm running machines don't request messages from each other. For the duration of the algorithm, they generate messages and send it to other machines in the cluster. I want to find a good performing message sending/receiving library that optimizes the parameters I mentioned. Is MINA or some other project you might know of could be what I'm looking for? Thank you very much in advance, semih
