<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="https://puma.ub.uni-stuttgart.de/tag/computing%20SimTech%20sparse"><owl:Ontology rdf:about=""><rdfs:comment>PUMA publications for /tag/computing%20SimTech%20sparse</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/28b341984a107175be05eebdda39e6c12/clausbraun"><owl:sameAs rdf:resource="/uri/bibtex/28b341984a107175be05eebdda39e6c12/clausbraun"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Mon Mar 19 16:15:07 CET 2018</swrc:date><swrc:booktitle>Proceedings of the IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT&#039;16)</swrc:booktitle><swrc:pages>21-26</swrc:pages><swrc:title>{Applying Efficient Fault Tolerance to Enable the Preconditioned Conjugate Gradient Solver on Approximate Computing Hardware}</swrc:title><swrc:year>2016</swrc:year><swrc:keywords>AxC CCG PCG SimTech approximate computing conjugate error-correction error-detection fault-tolerance gradient linear myown preconditioned solver sparse systems </swrc:keywords><swrc:abstract>A new technique is presented that allows to execute the preconditioned conjugate gradient (PCG) solver on approximate hardware while ensuring correct solver results. This technique expands the scope of approximate computing to scientific and engineering applications. The changing error resilience of PCG during the solving process is exploited by different levels of approximation which trade off numerical accuracy and hardware utilization. Such approximation levels are determined at runtime by periodically estimating the error resilience. An efficient fault tolerance technique allows reductions in hardware utilization by ensuring the continued exploitation of maximum allowed energy-accuracy trade-offs. Experimental results show that the hardware utilization is reduced on average by 14.5% and by up to 41.0% compared to executing PCG on accurate hardware.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2016/DFT_SchoeBW2016.pdf" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1109/DFT.2016.7684063" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Alexander Schöll"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Claus Braun"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Hans-Joachim Wunderlich"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><foaf:Group rdf:about="https://puma.ub.uni-stuttgart.de/tag/computing%20SimTech%20sparse"><foaf:name>computing SimTech sparse</foaf:name><description>Community for tag(s) computing SimTech sparse</description></foaf:Group></rdf:RDF>