@article{rezaei_khetawat_patil_mueller_hargrove_roman_2019, title={End-to-End Resilience for HPC Applications}, volume={11501}, ISBN={["978-3-030-20655-0"]}, ISSN={["1611-3349"]}, DOI={10.1007/978-3-030-20656-7_14}, abstractNote={A plethora of resilience techniques have been investigated to protect application kernels. If, however, such techniques are combined and they interact across kernels, new vulnerability windows are created. This work contributes the idea of end-to-end resilience by protecting windows of vulnerability between kernels guarded by different resilience techniques. It introduces the live vulnerability factor (LVF), a new metric that quantifies any lack of end-to-end protection for a given data structure. The work further promotes end-to-end application protection across kernels via a pragma-based specification for diverse resilience schemes with minimal programming effort. This lifts the data protection burden from application programmers allowing them to focus solely on algorithms and performance while resilience is specified and subsequently embedded into the code through the compiler/library and supported by the runtime system. In experiments with case studies and benchmarks, end-to-end resilience has an overhead over kernel-specific resilience of less than $$3\%$$ on average and increases protection against bit flips by a factor of three to four.}, journal={HIGH PERFORMANCE COMPUTING, ISC HIGH PERFORMANCE 2019}, author={Rezaei, Arash and Khetawat, Harsh and Patil, Onkar and Mueller, Frank and Hargrove, Paul and Roman, Eric}, year={2019}, pages={271–290} }
 @article{khetawat_atrey_li_mueller_pakin_2019, title={Implementing NChooseK on IBM Q Quantum Computer Systems}, volume={11497}, ISBN={["978-3-030-21499-9"]}, ISSN={["1611-3349"]}, DOI={10.1007/978-3-030-21500-2_13}, abstractNote={This work contributes a generalized model for quantum computation called NChooseK. NChooseK is based on a single parametrized primitive suitable to express a variety of problems that cannot be solved efficiently using classical computers but may admit an efficient quantum solution. We implement a code generator that, given arbitrary parameters for N and K, generates code suitable for execution on IBM Q quantum hardware. We assess the performance of the code generator, limitations in the size of circuit depth and number of gates, and propose optimizations. We identify future work to improve efficiency and applicability of the NChooseK model.}, journal={REVERSIBLE COMPUTATION (RC 2019)}, author={Khetawat, Harsh and Atrey, Ashlesha and Li, George and Mueller, Frank and Pakin, Scott}, year={2019}, pages={209–223} }