I am trying to implement parallel dijkstra algorithm in scala. I have a big adjacency matrix and I want to divide the work for say 100 indexes to each actor.
Is there any way to divide the work load to different actors like we do in MPI (using MPI_Scatter() Is there any way to reduce/broadcast the result like in MPI (MPI_AllReduce/ MPI_Broadcast). One brute way I can think of is to pass the whole matrix and just pass the index to each actor, but that would defeat the purpose of using actors. Besides, if I do like this, it would not be good idea if the actors are remotely located. Any suggestion would be of great help. Thanks -- >>>>>>>>>> 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.
