@article{4873, abstract = {Banks face a 'behavioralization' of their balance sheets since deposit funding increasingly consists of non-maturing deposits with uncertain cash flows exposing banks to asset liability (ALM) risk. Thus, this study examines the behavior of banks’ retail customers regarding non-maturing deposits. Our unique sample comprises the contract and cash flow data for 2.2 million individual contracts from 1991 to 2010. We find that contractual rewards, i.e., qualified interest payments, and government subsidies, effectively stabilize saving behavior and thus bank funding. The probability of an early deposit withdrawal decreases by approximately 40%, and cash flow volatility drops by about 25%. Our findings provide important insights for banks using pricing incentives to steer desired saving patterns for their non-maturing deposit portfolios. Finally, these results are informative regarding the bank liquidity regulations (Basel III) concerning the stability of deposits and the minimum requirements for risk management (European Commission DIRECTIVE 2006/48/EC). }, author = {Schlueter, Tobias and Sievers, Sönke and Hartmann-Wendels, Thomas}, journal = {Journal of Banking \& Finance}, keyword = {retail saving behavior, non-maturing deposits, deposit funding, contractual rewards, interest rate bonus, saving persistence, cash flow volatility}, pages = {43--61}, title = {{Bank funding stability, pricing strategies and the guidance of depositors}}, doi = {10.2139/ssrn.2001449}, volume = {51}, year = {2015}, } @article{1779, author = {Giefers, Heiner and Plessl, Christian and Förstner, Jens}, issn = {0163-5964}, journal = {ACM SIGARCH Computer Architecture News}, keyword = {funding-maxup, tet_topic_hpc}, number = {5}, pages = {65--70}, publisher = {ACM}, title = {{Accelerating Finite Difference Time Domain Simulations with Reconfigurable Dataflow Computers}}, doi = {10.1145/2641361.2641372}, volume = {41}, year = {2014}, } @article{2108, author = {Schumacher, Tobias and Plessl, Christian and Platzner, Marco}, issn = {0141-9331}, journal = {Microprocessors and Microsystems}, keyword = {funding-altera}, number = {2}, pages = {110--126}, title = {{IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators}}, doi = {10.1016/j.micpro.2011.04.002}, volume = {36}, year = {2012}, } @inproceedings{2180, author = {Beisel, Tobias and Wiersema, Tobias and Plessl, Christian and Brinkmann, André}, booktitle = {Proc. Workshop on Computer Architecture and Operating System Co-design (CAOS)}, keyword = {funding-enhance}, title = {{Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux}}, year = {2012}, } @inproceedings{2106, abstract = {Although the benefits of FPGAs for accelerating scientific codes are widely acknowledged, the use of FPGA accelerators in scientific computing is not widespread because reaping these benefits requires knowledge of hardware design methods and tools that is typically not available with domain scientists. A promising but hardly investigated approach is to develop tool flows that keep the common languages for scientific code (C,C++, and Fortran) and allow the developer to augment the source code with OpenMPlike directives for instructing the compiler which parts of the application shall be offloaded the FPGA accelerator. In this work we study whether the promise of effective FPGA acceleration with an OpenMP-like programming effort can actually be held. Our target system is the Convey HC-1 reconfigurable computer for which an OpenMP-like programming environment exists. As case study we use an application from computational nanophotonics. Our results show that a developer without previous FPGA experience could create an FPGA-accelerated application that is competitive to an optimized OpenMP-parallelized CPU version running on a two socket quad-core server. Finally, we discuss our experiences with this tool flow and the Convey HC-1 from a productivity and economic point of view.}, author = {Meyer, Björn and Schumacher, Jörn and Plessl, Christian and Förstner, Jens}, booktitle = {Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, keyword = {funding-upb-forschungspreis, funding-maxup, tet_topic_hpc}, pages = {189--196}, publisher = {IEEE}, title = {{Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?}}, doi = {10.1109/FPL.2012.6339370}, year = {2012}, } @inproceedings{2191, author = {Kenter, Tobias and Plessl, Christian and Platzner, Marco and Kauschke, Michael}, booktitle = {Intel European Research and Innovation Conference}, keyword = {funding-intel}, title = {{Estimation and Partitioning for CPU-Accelerator Architectures}}, year = {2011}, } @inproceedings{2200, author = {Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}, booktitle = {Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)}, isbn = {978-1-4503-0554-9}, keyword = {design space exploration, LLVM, partitioning, performance, estimation, funding-intel}, pages = {177--180}, publisher = {ACM}, title = {{Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures}}, doi = {10.1145/1950413.1950448}, year = {2011}, } @article{2201, author = {Schumacher, Tobias and Süß, Tim and Plessl, Christian and Platzner, Marco}, journal = {Int. Journal of Recon- figurable Computing (IJRC)}, keyword = {funding-altera}, publisher = {Hindawi Publishing Corp.}, title = {{FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study}}, doi = {10.1155/2011/760954}, year = {2011}, } @inproceedings{2428, abstract = { In this paper we present instance-specific accelerators for minimum-cost covering problems. We first define the covering problem and discuss a branch&bound algorithm to solve it. Then we describe an instance-specific hardware architecture that implements branch&bound in 3-valued logic and uses reduction techniques usually found in software solvers. Results for small unate covering problems reveal significant raw speedups. }, author = {Plessl, Christian and Platzner, Marco}, booktitle = {Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, keyword = {minimum covering, accelerator, funding-sundance}, pages = {85--91}, publisher = {CSREA Press}, title = {{Instance-Specific Accelerators for Minimum Covering}}, year = {2001}, }