{ "types" : { "Bookmark" : { "pluralLabel" : "Bookmarks" }, "Publication" : { "pluralLabel" : "Publications" }, "GoldStandardPublication" : { "pluralLabel" : "GoldStandardPublications" }, "GoldStandardBookmark" : { "pluralLabel" : "GoldStandardBookmarks" }, "Tag" : { "pluralLabel" : "Tags" }, "User" : { "pluralLabel" : "Users" }, "Group" : { "pluralLabel" : "Groups" }, "Sphere" : { "pluralLabel" : "Spheres" } }, "properties" : { "count" : { "valueType" : "number" }, "date" : { "valueType" : "date" }, "changeDate" : { "valueType" : "date" }, "url" : { "valueType" : "url" }, "id" : { "valueType" : "url" }, "tags" : { "valueType" : "item" }, "user" : { "valueType" : "item" } }, "items" : [ { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/28b341984a107175be05eebdda39e6c12/clausbraun", "tags" : [ "AxC","CCG","PCG","SimTech","approximate","computing","conjugate","error-correction","error-detection","fault-tolerance","gradient","linear","myown","preconditioned","solver","sparse","systems" ], "intraHash" : "8b341984a107175be05eebdda39e6c12", "interHash" : "819e882fc0ec03e0c6e332411bfbf42d", "label" : "Applying Efficient Fault Tolerance to Enable the Preconditioned Conjugate Gradient Solver on Approximate Computing Hardware", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:34:51", "count" : 6, "pub-type": "inproceedings", "booktitle": "Proceedings of the IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT'16)", "year": "2016", "url": "", "author": [ "Alexander Schöll","Claus Braun","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "21-26","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.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2016/DFT_SchoeBW2016.pdf", "doi" : "http://dx.doi.org/10.1109/DFT.2016.7684063", "bibtexKey": "SchoeBW2016" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/292cad6c6d7a90044e7289f504f6f4cf7/clausbraun", "tags" : [ "ABFT","GPGPU","SimTech","algorithm-based","computing","errors","fault","fault-tolerance","myown","scientific","simulation" ], "intraHash" : "92cad6c6d7a90044e7289f504f6f4cf7", "interHash" : "852ec5b9e00df1c4437700418d91759c", "label" : "Efficacy and Efficiency of Algorithm-Based Fault Tolerance on GPUs", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:29:40", "count" : 7, "pub-type": "inproceedings", "booktitle": "Proceedings of the IEEE International On-Line Testing Symposium (IOLTS'13)", "year": "2013", "url": "", "author": [ "Hans-Joachim Wunderlich","Claus Braun","Sebastian Halder" ], "authors": [ {"first" : "Hans-Joachim", "last" : "Wunderlich"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Sebastian", "last" : "Halder"} ], "pages": "240--243","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.\r\nModern 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.\r\nIn 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", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2013/IOLTS_WundeBH2013.pdf", "doi" : "http://dx.doi.org/10.1109/IOLTS.2013.6604090", "bibtexKey": "WundeBH2013" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2bfd0a364cc8901abde747841b8f60a69/clausbraun", "tags" : [ "AxC","SimTech","approximate","computing","energy-efficiency","fault","monitoring","myown","quality","tolerance" ], "intraHash" : "bfd0a364cc8901abde747841b8f60a69", "interHash" : "70d88e8ae6518962c2cc6a2b24f8fbd6", "label" : "Energy-efficient and Error-resilient Iterative Solvers for Approximate Computing", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:28:37", "count" : 3, "pub-type": "inproceedings", "booktitle": "Proceedings of the 23rd IEEE International Symposium on On-Line Testing and Robust System Design (IOLTS'17)", "year": "2017", "url": "", "author": [ "Alexander Schöll","Claus Braun","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "237--239","abstract": "Iterative solvers like the Preconditioned Conjugate Gradient (PCG) method are widely-used in compute-intensive domains including science and engineering that often impose tight accuracy demands on computational results. At the same time, the error resilience of such solvers may change in the course of the iterations, which requires careful adaption of the induced approximation errors to reduce the energy demand while avoiding unacceptable results. A novel adaptive method is presented that enables iterative Preconditioned Conjugate Gradient (PCG) solvers on Approximate Computing hardware with high energy efficiency while still providing correct results. The method controls the underlying precision at runtime using a highly efficient fault tolerance technique that monitors the induced error and the quality of intermediate computational results.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2017/IOLTS_SchoeBW2017.pdf", "doi" : "http://dx.doi.org/10.1109/IOLTS.2017.8046244", "bibtexKey": "SchoeBW2017" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/28a8906e8a66690ce05e59dd8e68e839c/clausbraun", "tags" : [ "AxC","SimTech","approximate","characterization","computing","fault","metrics","myown","precision","tolerance","variable" ], "intraHash" : "8a8906e8a66690ce05e59dd8e68e839c", "interHash" : "c3a518fb3206211e0d7da07a36661164", "label" : "Pushing the Limits: How Fault Tolerance Extends the Scope of Approximate Computing", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:26:57", "count" : 6, "pub-type": "inproceedings", "booktitle": "Proceedings of the 22nd IEEE International Symposium on On-Line Testing and Robust System Design (IOLTS'16)", "year": "2016", "url": "", "author": [ "Hans-Joachim Wunderlich","Claus Braun","Alexander Schöll" ], "authors": [ {"first" : "Hans-Joachim", "last" : "Wunderlich"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Alexander", "last" : "Schöll"} ], "pages": "133--136","abstract": "Approximate computing in hardware and software promises significantly improved computational performance combined with very low power and energy consumption. This goal is achieved by both relaxing strict requirements on accuracy and precision, and by allowing a deviating behavior from exact Boolean specifications to a certain extent. Today, approximate computing is often limited to applications with a certain degree of inherent error tolerance, where perfect computational results are not always required. However, in order to fully utilize its benefits, the scope of applications has to be significantly extended to other compute-intensive domains including science and engineering. To meet the often rather strict quality and reliability requirements for computational results in these domains, the use of appropriate characterization and fault tolerance measures is highly required. In this paper, we evaluate some of the available techniques and how they may extend the scope of application for approximate computing.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2016/IOLTS_WundeBS2016.pdf", "doi" : "http://dx.doi.org/10.1109/IOLTS.2016.7604686", "bibtexKey": "WundeBS2016" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2b9d42307aff55f949dce3efdc063ee86/clausbraun", "tags" : [ "Euler-Maruyama","GPU","SimTech","adaptive","aggregation","approximation","computing","heterogeneous","ligand-receptor-model","multi-timescale","myown","parallel","particle","simulation" ], "intraHash" : "b9d42307aff55f949dce3efdc063ee86", "interHash" : "8b3950b9a31a28b554ce868d67598d14", "label" : "Adaptive Parallel Simulation of a Two-Timescale-Model for Apoptotic Receptor-Clustering on GPUs", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:21:25", "count" : 5, "pub-type": "inproceedings", "booktitle": "Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine (BIBM'14)", "year": "2014", "url": "", "author": [ "Alexander Schöll","Claus Braun","Markus Daub","Guido Schneider","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Markus", "last" : "Daub"}, {"first" : "Guido", "last" : "Schneider"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "424--431","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.\r\n This new approach improves the simulation performance significantly and reduces computing times from months to hours for observation times of several seconds.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2014/BIBM_SchoeBDSW2014.pdf", "doi" : "http://dx.doi.org/10.1109/BIBM.2014.6999195", "bibtexKey": "SchoeBDSW2014" } ] }