Abstract: In a method for distributing execution of a problem to a plurality of K (wherein K?2) workers, a pair of identifiers (k, K) is transmitted to each worker, wherein k uniquely identifies each worker and wherein K indicates the total number of workers. Each worker applies a first rule deterministically and autonomously without communicating between the workers. The first rule is the same for each worker. The first rule splits the problem in m parts, wherein m?K. Each worker applies a second rule deterministically and autonomously without communicating between the workers. The second rule assigns each of the m parts to one of the K workers. The second rule is the same for each worker. Each worker processes exactly the parts that have been assigned thereto, thereby generating a unit of output. Each of the units of output from each worker is merged.