Abstract
The sorting network design represents a task that has often been considered as a benchmark for various applications of evolutionary design and optimization techniques. Although the specific structure of this class of circuits allows to use a simple encoding in combination with additional mechanisms for optimizing the area- and delay-efficiency of designed sorting networks, the design of large sorting networks represents a difficult task. This paper proposes a novel cellular automaton-based approach for the development of specific instances of sorting networks. In order to explore the area of generative cellular automata applied on this specific circuit structures, two different encodings are introduced: (1) an absolute encoding and (2) a relative encoding. The abilities of the both techniques are investigated and a comparative study is provided considering a variety of experimental settings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bidlo, M., Vasicek, Z.: Gate-level evolutionary development using cellular automata. In: Proc. of The 3rd NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2008, pp. 11–18. IEEE Computer Society, Los Alamitos (2008)
Bidlo, M., Škarvada, J.: Instruction-based development: From evolution to generic structures of digital circuits. International Journal of Knowledge-Based and Intelligent Engineering Systems 12(3), 221–236 (2008)
Choi, S.S., Moon, B.R.: A hybrid genetic search for the sorting network problem with evolving parallel layers. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pp. 258–265. Morgan Kaufmann, San Francisco (2001)
Choi, S.S., Moon, B.R.: Isomorphism, normalization, and a genetic algorithm for sorting network optimization. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 327–334. Morgan Kaufmann Publishers Inc., San Francisco (2002)
Choi, S.S., Moon, B.R.: More effective genetic search for the sorting network problem. In: Proc. of the Genetic and Evolutionary Computation Conference, GECCO 2002, pp. 335–342. Morgan Kaufmann, New York (2002)
Gordon, T.G.W., Bentley, P.J.: Towards development in evolvable hardware. In: Proc. of the 2002 NASA/DoD Conference on Evolvable Hardware, pp. 241–250. IEEE Press, Washington D.C. (2002)
Haddow, P.C., Tufte, G.: Bridging the genotype–phenotype mapping for digital FPGAs. In: Proc. of the 3rd NASA/DoD Workshop on Evolvable Hardware, pp. 109–115. IEEE Computer Society, Los Alamitos (2001)
Hillis, W.D.: Co-evolving parasites improve simulated evolution as an optimization procedure. Physica D 42(1–3), 228–234 (1990)
Koza, J.R., Bennett, F.H., Andre, D., Keane, M.A.: Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann, San Francisco (1999)
Juillé, H.: Evolution of non-deterministic incremental algorithms as a new approach for search in state spaces. In: Proc. of 6th Int. Conference on Genetic Algorithms, pp. 351–358. Morgan Kaufmann, San Francisco (1995)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1998)
Miller, J.F.: Evolving developmental programs for adaptation, morphogenesis and self-repair. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS (LNAI), vol. 2801, pp. 256–265. Springer, Heidelberg (2003)
Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)
Miller, J.F., Thomson, P.: A developmental method for growing graphs and circuits. In: Tyrrell, A.M., Haddow, P.C., Torresen, J. (eds.) ICES 2003. LNCS, vol. 2606, pp. 93–104. Springer, Heidelberg (2003)
von Neumann, J.: The Theory of Self-Reproducing Automata. In: Burks, A.W. (ed.). University of Illinois Press, US (1966)
Sekanina, L., Bidlo, M.: Evolutionary design of arbitrarily large sorting networks using development. Genetic Programming and Evolvable Machines 6(3), 319–347 (2005)
Sipper, M.: Evolution of Parallel Cellular Machines. LNCS, vol. 1194. Springer, Heidelberg (1997)
Tufte, G., Haddow, P.C.: Towards development on a silicon-based cellular computing machine. Natural Computing 4(4), 387–416 (2005)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign IL (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bidlo, M., Vasicek, Z., Slany, K. (2010). Sorting Network Development Using Cellular Automata. In: Tempesti, G., Tyrrell, A.M., Miller, J.F. (eds) Evolvable Systems: From Biology to Hardware. ICES 2010. Lecture Notes in Computer Science, vol 6274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15323-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-15323-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15322-8
Online ISBN: 978-3-642-15323-5
eBook Packages: Computer ScienceComputer Science (R0)