Abstract
Fault tolerance is an important objective for circuit design, so it is natural to apply genetic programming techniques that are already being used for circuit design to enhance fault tolerance. We present preliminary evidence that co-evolving faults with circuits enhances the masking of faults in evolved circuits. Our test systems are sorting networks, since these are simple enough to analyze. We show that the overall impact of faults in an evolved sorting network can be reduced proportionally to the strength of co-evolutionary pressure.
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
Masner, J., Cavalieri, J., Frenzel, J., Foster, J.A.: Size verses robustness in evolved sorting networks: Is bigger better? In: Lohn, J., Stoica, A., Keyeulen, D. (eds.) The Second NASA/DoD Workshop on Evolvable Hardware (EH), Palo Alto, CA, USA, pp. 81–90. IEEE Computer Society, Los Alamitos (2000)
Masner, J., Cavalieri, J., Frenzel, J., Foster, J.: Representation and robustness fir evovled sorting networks. In: Lohn, J., Stoica, A., Keyeulen, D. (eds.) Proceedings of the 1st NASA/DoD Workshop on Evolvable Hardware, Pasadena, CA, USA, pp. 225–261 (1999)
Institute of Electrical and Electronics Engineers, IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossories (1990)
Shooman, M.L.: Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design. John Wiley and Sons, Chichester (2002)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn., vol. 3. Addison-Wesley, Reading (1975)
Hillis, D.W.: Co-evolving parasites improves simulated evolution as an optimization procedure. In: Langton, Taylor, Farmer, Rasmussen (eds.) Artificial Life II, vol. 10, pp. 313–324. Addison-Wesley, Reading (1992)
Batcher, K.E.: Sorting networks and their applications. In: Conference Proceedings if the 1968 Spring Joint Computer Conference, Reston, VA, May 1968, vol. 32, pp. 307–314. AFIPS Press (1968)
Gannett, Kothari, Yen.: On optimal parallelization of sorting networks. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, vol. 7 (1987)
Siegel, R.: Minimum storage sorting networks. IEEE Transactions on Computers C-34 (April 1985)
Mitchell, M.: An Introduction to Genetic Algorithms. Complex Adaptive Systems. MIT Press, Cambridge (1996)
Seredynski, F.: Competitive coevolutionary multi-agent systems: The application to mapping and scheduling problems. Journal of Parallel and Distributed Computing 47, 39–57 (1997)
Stanley, K.O., Miikkulainen, R.: Competitive coevolution through evolutionary complexification. Tech. Rep. AI02-298, The University of Texas at Austin, Department of Computer Sciences, December 10, Wednesday, September 10, 103 19:16:38 GMT (2002)
Rosin, C.D., Belew, R.K.: New methods for competitive coevolution. Tech. Rep. CS96-491, Cognitive Computer Science Research Group, University of California, San Diego, CA (1996) (to appear in Evolutionary Computation 5:1)
Clavecie, J.M., De Jong, K., Sheta, A.F.: Robust nonlinear control design using competitive coevolution. In: Proc. of the 2000 Congress on Evolutionary Computation (Piscataway, NJ), pp. 403–409, IEEE Service Center (2000)
Assaf, S., Upfal, E.: Fault tolerant sorting networks. SIAM Journal on Discrete Mathematics 4, 472–480 (1991)
Kantawala, K., Tao, D.L.: Designing concurrent checking sorting networks. In: Laprie, J.-C. (ed.) Proceedings of the 23rd Annual International Symposium on Fault-Tolerant Computing (FTCS 1993), Toulouse, France, June 1993, pp. 250–259. IEEE Computer Society Press, Los Alamitos (1993)
Leighton, T., Ma, Y.: Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults. SIAM Journal on Computing 29, 258–273 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harrison, M.L., Foster, J.A. (2004). Co-evolving Faults to Improve the Fault Tolerance of Sorting Networks. In: Keijzer, M., O’Reilly, UM., Lucas, S., Costa, E., Soule, T. (eds) Genetic Programming. EuroGP 2004. Lecture Notes in Computer Science, vol 3003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24650-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24650-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21346-8
Online ISBN: 978-3-540-24650-3
eBook Packages: Springer Book Archive