<?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/SimTech%20computing%20simulation"><owl:Ontology rdf:about=""><rdfs:comment>PUMA publications for /tag/SimTech%20computing%20simulation</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/292cad6c6d7a90044e7289f504f6f4cf7/clausbraun"><owl:sameAs rdf:resource="/uri/bibtex/292cad6c6d7a90044e7289f504f6f4cf7/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 On-Line Testing Symposium (IOLTS&#039;13)</swrc:booktitle><swrc:pages>240--243</swrc:pages><swrc:title>{Efficacy and Efficiency of Algorithm-Based Fault Tolerance on GPUs}</swrc:title><swrc:year>2013</swrc:year><swrc:keywords>ABFT GPGPU SimTech algorithm-based computing errors fault fault-tolerance myown scientific simulation </swrc:keywords><swrc:abstract>Computer simulations drive innovations in science and industry, and they are gaining more and more importance. However, their high computational demand generates extraordinary challenges for computing systems. Typical highperformance computing systems, which provide sufficient performance and high reliability, are extremly expensive.
Modern GPUs offer high performance at very low costs, and they enable simulation applications on the desktop. However, they are increasingly prone to transient effects and other reliability threats. To fulfill the strict reliability requirements in scientific computing and simulation technology, appropriate fault tolerance measures have to be integrated into simulation applications for GPUs. Algorithm-Based Fault Tolerance on GPUs has the potential to meet these requirements.
In this work we investigate the efficiency and the efficacy of ABFT for matrix operations on GPUs. We compare ABFT against fault tolerance schemes that are based on redundant computations and we evaluate its error detection capabilities</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2013/IOLTS_WundeBH2013.pdf" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1109/IOLTS.2013.6604090" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Hans-Joachim Wunderlich"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Claus Braun"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Sebastian Halder"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2b9d42307aff55f949dce3efdc063ee86/clausbraun"><owl:sameAs rdf:resource="/uri/bibtex/2b9d42307aff55f949dce3efdc063ee86/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 Conference on Bioinformatics and Biomedicine (BIBM&#039;14)</swrc:booktitle><swrc:pages>424--431</swrc:pages><swrc:title>{Adaptive Parallel Simulation of a Two-Timescale-Model for Apoptotic Receptor-Clustering on GPUs}</swrc:title><swrc:year>2014</swrc:year><swrc:keywords>Euler-Maruyama GPU SimTech adaptive aggregation approximation computing heterogeneous ligand-receptor-model multi-timescale myown parallel particle simulation </swrc:keywords><swrc:abstract>Computational biology contributes important solutions for major biological challenges. Unfortunately, most applications in computational biology are highly computeintensive and associated with extensive computing times. Biological problems of interest are often not treatable with traditional simulation models on conventional multi-core CPU systems. This interdisciplinary work introduces a new multi-timescale simulation model for apoptotic receptor-clustering and a new parallel evaluation algorithm that exploits the computational performance of heterogeneous CPU-GPU computing systems. For this purpose, the different dynamics involved in receptor-clustering are separated and simulated on two timescales. Additionally, the time step sizes are adaptively refined on each timescale independently.
 This new approach improves the simulation performance significantly and reduces computing times from months to hours for observation times of several seconds.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2014/BIBM_SchoeBDSW2014.pdf" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1109/BIBM.2014.6999195" 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="Markus Daub"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Guido Schneider"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Hans-Joachim Wunderlich"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description><foaf:Group rdf:about="https://puma.ub.uni-stuttgart.de/tag/SimTech%20computing%20simulation"><foaf:name>SimTech computing simulation</foaf:name><description>Community for tag(s) SimTech computing simulation</description></foaf:Group></rdf:RDF>