杏吧原创

A Japanese team has increased the speed of parallel computing by using a
genetic algorithm to schedule processing tasks. Tatsuhiro Tsuchiya and
colleagues at Osaka University have designed their evolutionary algorithm to
allow only the 鈥渇ittest鈥� task sequences鈥攖he computer equivalents of
chromosomes鈥攖o survive (Microprocessors and Microsystems, vol 22,
p 197). The surviving sequences become the tasks executed by each processor node
in an array. Using task duplication, so that the task can be executed as soon as
a node is free, the algorithm performed as well as鈥攁nd sometimes
better鈥攖han DSH, a common non-genetic task-scheduling system.