python parallel computing: split keyspace to give each node a range to work on

Posted by MatToufoutu on Stack Overflow See other posts from Stack Overflow or by MatToufoutu
Published on 2010-03-21T20:55:22Z Indexed on 2010/03/21 21:01 UTC
Read the original article Hit count: 180

Filed under:
|
|
|

My question is rather complicated for me to explain, as i'm not really good at maths, but i'll try to be as clear as possible.

I'm trying to code a cluster in python, which will generate words given a charset (i.e. with lowercase: aaaa, aaab, aaac, ..., zzzz) and make various operations on them. I'm searching how to calculate, given the charset and the number of nodes, what range each node should work on (i.e.: node1: aaaa-azzz, node2: baaa-czzz, node3: daaa-ezzz, ...). Is it possible to make an algorithm that could compute this, and if it is, how could i implement this in python?

I really don't know how to do that, so any help would be much appreciated

© Stack Overflow or respective owner

Related posts about python

Related posts about clustering