Inherent Fault Tolerance in Evolved Sorting Networks

This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emerging directly from the evolutionary process, but none has examined the large number of diverse networks we used. Despite a thorough study, the linkage between evolution and increased robustness is unclear. Discussion Previous research has suggested that evolutionary search techniques may produce some fault tolerance characteristics as a by-product of the process. Masner et al. [1, 2] found evidence of this while evolving sorting networks, as their evolved circuits were more tolerant of low-level logic faults than hand-designed networks. They also introduced a new metric, bitwise stability (BS), to measure the degree of robustness in sorting networks. We evaluated the hypothesis that evolved sorting networks were more robust than those designed by hand, as measured by BS. We looked at sorting networks with larger...

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: Rob Shepherd, James A. Foster
• Keywords: Fault Tolerance, GECCO 2003, Masner Et Al, Sorting