Evolutionary Design of Arbitrarily Large Sorting Networks Using Development |
| |
Authors: | Email author" target="_blank">Luká??SekaninaEmail author Michal?Bidlo |
| |
Affiliation: | (1) Faculty of Information Technology, Brno University of Technology, Božetěchova 2, 612 66 Brno, Czech Republic |
| |
Abstract: | An evolutionary algorithm is combined with an application-specific developmental scheme in order to evolve efficient arbitrarily
large sorting networks. First, a small sorting network (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger sorting network (solving a larger instance of the problem). Then the same constructor
is used to create a new instance of the sorting network from the created larger sorting network and so on. The proposed approach
allowed us to rediscover the conventional principle of insertion which is traditionally used for constructing large sorting networks. Furthermore, the principle was improved by means of
the evolutionary technique. The evolved sorting networks exhibit a lower implementation cost and delay. |
| |
Keywords: | evolutionary algorithm development sorting network scalability |
本文献已被 SpringerLink 等数据库收录! |