This is a simplified version of my problem:
n*m
- matrix of type int[][]
, we split this matrix into the set of n
row-vectors and put them in a queue.k
clients somewhere on the network if and only if the client is free to take the vector (some client-status checking in a form of message-passing will be handy).I'm going to use Akka distributed computation framework with Java. Could you please tell me where to start learning the Akka tools, because I do not yet know how to use it. Actors will probably be those clients..
Akka has a getting-started tutorial that computes Pi by a process very similar to what you've described.
There's also of course a Scala version.