TY - CONF AU - Johannesmann, Sarah AU - Webersen, Manuel AU - Düchting, Julia AU - Claes, Leander AU - Henning, Bernd ID - 9718 T2 - 45th Annual Review of Progress in Quantitative Nondestructive Evaluation TI - Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves VL - 38 ER - TY - BOOK ED - Flotmann-Scholz, Christina ED - Lienen, Anna ID - 9719 TI - Victorian Ideologies in Contemporary British Cultures ER - TY - CHAP AU - Flotmann-Scholz, Christina AU - Lienen, Anna ED - Flotmann-Scholz, Christina ED - Lienen, Anna ID - 9720 T2 - Victorian Ideologies in Contemporary British Cultures TI - (New?) Masculinities in Nineteenth-Century Sensation Fiction and Contemporary Black British Fiction ER - TY - CHAP AU - Flotmann-Scholz, Christina AU - Lienen, Anna ED - Flotmann-Scholz, Christina ED - Lienen, Anna ID - 9721 T2 - Victorian Ideologies in Contemporary British Cultures TI - Introduction ER - TY - CONF AU - Neumann, Jürgen AU - Gutt, Dominik ID - 9774 T2 - Proceedings of the 25th Americas Conference on Information Systems (AMCIS) TI - Money Makes the Reviewer Go Round – Ambivalent Effects of Online Review Elicitation in B2B Markets ER - TY - CONF AU - Neumann, Jürgen AU - Gutt, Dominik AU - Görzen, Thomas AU - Kundisch, Dennis ID - 9775 T2 - Proceedings of the 25th Americas Conference on Information Systems (AMCIS) TI - When does Local Status Matter? – The Relationship between Reviewer Location and Perceived Usefulness of Online Reviews ER - TY - GEN AU - Poniatowski, Martin AU - Neumann, Jürgen AU - Kundisch, Dennis ID - 9776 T2 - Proceedings of the 25th Americas Conference on Information Systems (AMCIS) TI - Reviewing the Vendor or the Product – Analyzing Vendor versus Product Representation in B2B Review Systems ER - TY - CONF AU - Poniatowski, Martin AU - Neumann, Jürgen AU - Görzen, Thomas AU - Kundisch, Dennis ID - 9777 T2 - Proceedings of the 27th European Conference on Information Systems (ECIS) TI - Organizing Their Thoughts – How Online Review Templates Affect the Review Text ER - TY - CONF AU - Gutt, Dominik AU - Neumann, Jürgen ID - 9778 T2 - Proceedings of the 27th European Conference on Information Systems (ECIS) TI - The Virtues of Anonymity - An Empirical Investigation of the Relationship between B2B Online Ratings and Reviewer Self-Disclosure ER - TY - CONF AU - Neumann, Jürgen AU - Gutt, Dominik ID - 9779 T2 - Proceedings of the 27th European Conference on Information Systems (ECIS) TI - He Who Pays the Piper Calls the Tune: Online Review Elicitation by Sellers and Third-Party Platforms in B2B Markets ER - TY - CONF AU - Bohn, Nicolai ID - 9780 T2 - Proceedings of the 25th Americas Conference on Information Systems (AMCIS) TI - Do Digital Startups Prepare for Technology Pivots? - An Initial Analysis of Job Adverts ER - TY - CHAP AU - Herzig, Bardo AU - Klar, Tilman-Mathies ED - Heider-Lang, J. ED - Merkert, A. ID - 9798 T2 - Digitale Transformation in der Bildungslandschaft- den analogen Stecker ziehen? TI - Digitale Modellierungen sozialer Räume ER - TY - CONF AB - Remarkable advantages of Containers (CNs) over Virtual Machines (VMs) such as lower overhead and faster startup has gained the attention of Communication Service Providers (CSPs) as using CNs for providing Virtual Network Functions (VNFs) can save costs while increasing the service agility. However, as it is not feasible to realise all types of VNFs in CNs, the coexistence of VMs and CNs is proposed. To put VMs and CNs together, an orchestration framework that can chain services across distributed and heterogeneous domains is required. To this end, we implemented a framework by extending and consolidating state-of-the-art tools and technologies originated from Network Function Virtualization (NFV), Software-defined Networking (SDN) and cloud computing environments. This framework chains services provisioned across Kubernetes and OpenStack domains. During the demo, we deploy a service consist of CN- and VM-based VNFs to demonstrate different features provided by our framework. AU - Razzaghi Kouchaksaraei, Hadi AU - Karl, Holger ID - 9809 KW - Network Function Virtualization KW - Software-defined Networking KW - Cloud Computing KW - service orchestration KW - OpenStack KW - Kubernetes T2 - 13th ACM International Conference on Distributed and Event-based Systems TI - Service Function Chaining Across OpenStack and Kubernetes Domains ER - TY - BOOK ED - Flotmann-Scholz, Christina ED - Lienen, Anna ID - 9810 TI - Victorian Ideologies in Contemporary British Cultures ER - TY - CONF AU - Betzing, Jan H AU - Niemann, Marco AU - Berendes, Carsten Ingo ID - 9821 T2 - Human Practice. Digital Ecologies. Our Future. - Tagungsband der 14. Internationalen Tagung Wirtschaftsinformatik (WI 2019) TI - Privacy-friendly User Location Tracking with Smart Devices: The BeaT Prototype ER - TY - JOUR AU - Soenen, Thomas AU - Tavernier, Wouter AU - Peuster, Manuel AU - Vicens, Felipe AU - Xilouris, George AU - Kolometsos, Stavros AU - Kourtis, Michail-Alexandros AU - Colle, Didier ID - 9823 JF - IEEE Communications Magazine SN - 0163-6804 TI - Empowering Network Service Developers: Enhanced NFV DevOps and Programmable MANO ER - TY - JOUR AU - Peuster, Manuel AU - Schneider, Stefan Balthasar AU - Zhao, Mengxuan AU - Xilouris, George AU - Trakadas, Panagiotis AU - Vicens, Felipe AU - Tavernier, Wouter AU - Soenen, Thomas AU - Vilalta, Ricard AU - Andreou, George AU - Kyriazis, Dimosthenis AU - Karl, Holger ID - 9824 JF - IEEE Communications Magazine SN - 0163-6804 TI - Introducing Automated Verification and Validation for Virtualized Network Functions and Services ER - TY - JOUR AU - Tiedau, Johannes AU - Meyer-Scott, Evan AU - Nitsche, Thomas AU - Barkhofen, Sonja AU - Bartley, Tim AU - Silberhorn, Christine ID - 9826 JF - Optics Express SN - 1094-4087 TI - A high dynamic range optical detector for measuring single photons and bright light ER - TY - CONF AB - A business model describes the mechanisms whereby a firm creates, delivers, and captures value. Following the steadily growing interest in business model innovation, software tools have shown great potential in supporting business model development and innovation. Yet, understanding the cognitive processes involved in the generation of business model ideas is an aspect of software design-knowledge that has so far been neglected. To investigate whether providing stimuli – in this case, brainstorming questions – can enhance individual creativity in this context, we conduct an exploratory experiment with over 100 participants. Our study is the first to systematically investigate the process of idea generation using a software-based business model development tool with stimuli. Our preliminary findings have the potential to support the future development of business model development tools and to refine the research design used to evaluate such tools. AU - Szopinski, Daniel ID - 9850 KW - Business model innovation KW - idea generation KW - cognitive stimuli KW - business model development tools KW - experiment KW - creativity support system T2 - Proceedings of the ACM Creativity & Cognition TI - Can stimuli improve business model idea generation? Developing software-based tools for business model innovation ER - TY - JOUR AB - Business model innovation is typically taught in small seminars at universities. Teaching this intrinsically task-oriented subject to a large number of students is a challenge. In this paper we address this challenge by proposing an experiential and interactive approach to teaching business models in a large classroom setting. AU - Szopinski, Daniel ID - 9853 IS - 3 JF - Journal of Business Models KW - Business model teaching KW - peer assessment KW - experiential learning TI - Squaring the circle: Business model teaching in large classroom settings VL - 7 ER - TY - JOUR AU - Protte, Maximilian AU - Weber, Nils AU - Golla, Christian AU - Zentgraf, Thomas AU - Meier, Cedrik ID - 9897 JF - Journal of Applied Physics SN - 0021-8979 TI - Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas VL - 125 ER - TY - JOUR AU - Fritz, Marlon AU - Gries, Thomas AU - Feng, Yuanhua ID - 9920 JF - Economics Letters SN - 0165-1765 TI - Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth? VL - 181 ER - TY - CONF AU - Yigitbas, Enes AU - Jovanovikj, Ivan AU - Josifovska, Klementina AU - Sauer, Stefan AU - Engels, Gregor ID - 9939 T2 - Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019) TI - On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback ER - TY - JOUR AU - Gutt, Dominik AU - Herrmann, Philipp AU - Rahman, Mohammad ID - 3936 IS - 3 JF - Information Systems Research TI - Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions VL - 30 ER - TY - CONF AU - Görzen, Thomas ID - 4400 T2 - Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS) TI - Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms ER - TY - GEN AB - Öffentlich gelistete Firmen, die die Mehrheit an anderen börsennotierten Unternehmen er-werben und den Kapitalmarkt an den Synergieerwartungen teilhaben lassen, werden mit höheren kumulativen abnormalen Renditen im Ankündigungszeitpunkt belohnt verglichen mit solchen Unternehmen, die diese geheim halten. Des Weiteren ist die empirische Evi-denz konsistent mit der Idee, dass diese Käuferunternehmen ihre Transaktionen besser in-tegrieren, weil auch die industrieadjustierten Ein- und Zweijahresrenditen der ankündigen-den Unternehmen ökonomisch und statistisch signifikant höher sind als die der zurückhal-tenden Käuferfirmen. AU - Mehring, Oliver AU - Sievers, Sönke AU - Keienburg, Georg AU - Kengelbach, Jens ID - 5411 TI - Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien? VL - 3-4 ER - TY - CONF AB - We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. Furthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting. AU - Lazos, Philip AU - Goldberg, Paul AU - Skopalik, Alexander AU - Gerstgrasser, Matthias AU - de Keijzer, Bart ID - 5471 T2 - Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) TI - Multi-unit Bilateral Trade ER - TY - JOUR AB - Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes. AU - Rauchecker, Gerhard AU - Schryen, Guido ID - 6512 IS - 104 JF - Computers & Operations Research KW - parallel machine scheduling with setup times KW - parallel branch-and-price algorithm KW - high performance computing KW - master/worker parallelization TI - Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm ER - TY - CONF AB - Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners. AU - Schuhbeck, Veronika AU - Siegfried, Nils AU - Dorner, Verena AU - Benlian, Alexander AU - Scholz, Michael AU - Schryen, Guido ID - 6514 KW - Recommender Agents KW - Preference Elicitation Method KW - Trade-off Exposure KW - Customer Satisfaction T2 - Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik TI - Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents ER - TY - GEN AU - Seutter, Janina ID - 6628 TI - Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung ER - TY - JOUR AU - Gries, Thomas AU - Fritz, Marlon AU - Yuanhua, Feng ID - 6734 IS - 1 JF - Oxford Bulletin of Economics and Statistics TI - Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics VL - 81 ER - TY - CONF AU - Müller, Michelle AU - Gutt, Dominik ID - 6856 T2 - Wirtschaftsinformatik Proceedings 2019 TI - Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods ER - TY - CONF AU - Poniatowski, Martin AU - Neumann, Jürgen AU - Görzen, Thomas AU - Kundisch, Dennis ID - 6857 T2 - Wirtschaftsinformatik Proceedings 2019 TI - A Semi-Automated Approach for Generating Online Review Templates, ER - TY - CONF AU - Afifi, Haitham AU - Karl, Holger ID - 6860 T2 - 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019) TI - Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding ER - TY - CONF AB - We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval. AU - Götte, Thorsten AU - Vijayalakshmi, Vipin Ravindran AU - Scheideler, Christian ID - 6976 T2 - Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) TI - Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary ER - TY - CONF AB - FPGA devices have been proving to be good candidates to accelerate applications from different research topics. For instance, machine learning applications such as K-Means clustering usually relies on large amount of data to be processed, and, despite the performance offered by other architectures, FPGAs can offer better energy efficiency. With that in mind, Intel has launched a platform that integrates a multicore and an FPGA in the same package, enabling low latency and coherent fine-grained data offload. In this paper, we present a parallel implementation of the K-Means clustering algorithm, for this novel platform, using OpenCL language, and compared it against other platforms. We found that the CPU+FPGA platform was more energy efficient than the CPU-only approach from 70.71% to 85.92%, with Standard and Tiny input sizes respectively, and up to 68.21% of performance improvement was obtained with Tiny input size. Furthermore, it was up to 7.2×more energy efficient than an Intel® Xeon Phi ™, 21.5×than a cluster of Raspberry Pi boards, and 3.8×than the low-power MPPA-256 architecture, when the Standard input size was used. AU - Souza, Matheus A. AU - Maciel, Lucas A. AU - Penna, Pedro Henrique AU - Freitas, Henrique C. ID - 16411 KW - pc2-harp-ressources SN - 9781538677698 T2 - 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD) TI - Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package ER - TY - CONF AB - In recent years, FPGAs have been successfully employed for the implementation of efficient, application-specific accelerators for a wide range of machine learning tasks. In this work, we consider probabilistic models, namely, (Mixed) Sum-Product Networks (SPN), a deep architecture that can provide tractable inference for multivariate distributions over mixed data-sources. We develop a fully pipelined FPGA accelerator architecture, including a pipelined interface to external memory, for the inference in (mixed) SPNs. To meet the precision constraints of SPNs, all computations are conducted using double-precision floating point arithmetic. Starting from an input description, the custom FPGA-accelerator is synthesized fully automatically by our tool flow. To the best of our knowledge, this work is the first approach to offload the SPN inference problem to FPGA-based accelerators. Our evaluation shows that the SPN inference problem benefits from offloading to our pipelined FPGA accelerator architecture. AU - Sommer, Lukas AU - Oppermann, Julian AU - Molina, Alejandro AU - Binnig, Carsten AU - Kersting, Kristian AU - Koch, Andreas ID - 16413 KW - pc2-harp-ressources SN - 9781538684771 T2 - 2018 IEEE 36th International Conference on Computer Design (ICCD) TI - Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators ER - TY - GEN AU - Lienen, Julian ID - 16415 TI - Automated Feature Engineering on Time Series Data ER - TY - CONF AB - The performance of High-Level Synthesis (HLS) applications with irregular data structures is limited by its imperative programming paradigm like C/C++. In this paper, we show that constructing concurrent data structures with channels, a programming construct derived from CSP (communicating sequential processes) paradigm, is an effective approach to improve the performance of these applications. We evaluate concurrent data structure for FPGA by synthesizing a K-means clustering algorithm on the Intel HARP2 platform. A fully pipelined KMC processing element can be synthesized from OpenCL with the help of a SPSC (single-producer-single-consumer) queue and stack built from channels, achieving 15.2x speedup over a sequential baseline. The number of processing element can be scaled up by leveraging a MPMC (multiple-producer-multiple-consumer) stack with work distribution for dynamic load balance. Evaluation shows that an additional 3.5x speedup can be achieved when 4 processing element is instantiated. These results show that the concurrent data structure built with channels has great potential for improving the parallelism of HLS applications. We hope that our study will stimulate further research into the potential of channel-based HLS. AU - Yan, Hui AU - Li, Zhaoshi AU - Liu, Leibo AU - Yin, Shouyi AU - Wei, Shaojun ID - 16417 KW - pc2-harp-ressources SN - 9781450361378 T2 - Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays TI - Constructing Concurrent Data Structures on FPGA with Channels ER - TY - JOUR AB - Field-Programmable Gate Arrays (FPGAs) are widely used in the central signal processing design of the Square Kilometer Array (SKA) as hardware accelerators. The frequency domain acceleration search (FDAS) module is an important part of the SKA1-MID pulsar search engine. To develop for a yet to be finalized hardware, for cross-discipline interoperability and to achieve fast prototyping, OpenCL as a high-level FPGA synthesis approaches employed to create the sub-modules of FDAS. The FT convolution and the harmonic-summing plus some other minor sub-modules are elements in the FDAS module that have been well-optimized separately before. In this paper, we explore the design space of combining well-optimized designs, dealing with the ensuing need to trade-off and compromise. Pipeline computing is employed to handle multiple input arrays at high speed. The hardware target is to employ multiple high-end FPGAs to process the combined FDAS module. The results show interesting consequences, where the best individual solutions are not necessarily the best solutions for the speed of a pipeline where FPGA resources and memory bandwidth need to be shared. By proposing multiple buffering techniques to the pipeline, the combined FDAS module can achieve up to 2[Formula: see text] speedup over implementations without pipeline computing. We perform an extensive experimental evaluation on multiple high-end FPGA cards hosted in a workstation and compare to a technology comparable mid-range GPU. AU - Wang, Haomiao AU - Thiagaraj, Prabu AU - Sinnen, Oliver ID - 16420 JF - Journal of Astronomical Instrumentation KW - pc2-harp-ressources SN - 2251-1717 TI - Combining Multiple Optimized FPGA-based Pulsar Search Modules Using OpenCL ER - TY - JOUR AB - Intel recently introduced the Heterogeneous Architecture Research Platform, HARP. In this platform, the Central Processing Unit and a Field-Programmable Gate Array are connected through a high-bandwidth, low-latency interconnect and both share DRAM memory. For this platform, Open Computing Language (OpenCL), a High-Level Synthesis (HLS) language, is made available. By making use of HLS, a faster design cycle can be achieved compared to programming in a traditional hardware description language. This, however, comes at the cost of having less control over the hardware implementation. We will investigate how OpenCL can be applied to implement a real-time guided image filter on the HARP platform. In the first phase, the performance-critical parameters of the OpenCL programming model are defined using several specialized benchmarks. In a second phase, the guided image filter algorithm is implemented using the insights gained in the first phase. Both a floating-point and a fixed-point implementation were developed for this algorithm, based on a sliding window implementation. This resulted in a maximum floating-point performance of 135 GFLOPS, a maximum fixed-point performance of 430 GOPS and a throughput of HD color images at 74 frames per second. AU - Faict, Thomas AU - D’Hollander, Erik H. AU - Goossens, Bart ID - 16422 JF - Algorithms KW - pc2-harp-ressources SN - 1999-4893 TI - Mapping a Guided Image Filter on the HARP Reconfigurable Architecture Using OpenCL ER - TY - JOUR AB - Heterogeneous computing that exploits simultaneous co-processing with different device types has been shown to be effective at both increasing performance and reducing energy consumption. In this paper, we extend a scheduling framework encapsulated in a high-level C++ template and previously developed for heterogeneous chips comprising CPU and GPU cores, to new high-performance platforms for the data center, which include a cache coherent FPGA fabric and many-core CPU resources. Our goal is to evaluate the suitability of our framework with these new FPGA-based platforms, identifying performance benefits and limitations.We target the state-of-the-art HARP processor that includes 14 high-end Xeon classes tightly coupled to a FPGA device located in the same package. We select eight benchmarks from the high-performance computing domain that have been ported and optimized for this heterogeneous platform. The results show that a dynamic and adaptive scheduler that exploits simultaneous processing among the devices can improve performance up to a factor of 8 × compared to the best alternative solutions that only use the CPU cores or the FPGA fabric. Moreover, our proposal achieves up to 15% and 37% of improvement compared to the best heterogeneous solutions found with a dynamic and static schedulers, respectively. AU - Rodríguez, Andrés AU - Navarro, Angeles AU - Asenjo, Rafael AU - Corbera, Francisco AU - Gran, Rubén AU - Suárez, Darío AU - Nunez-Yanez, Jose ID - 16423 JF - The Journal of Supercomputing KW - pc2-harp-ressources SN - 0920-8542 TI - Parallel multiprocessing and scheduling on the heterogeneous Xeon+FPGA platform ER - TY - CONF AB - Transactional Memory (TM) has been considered as a promising alternative to existing synchronization operations, which are often the largest stumbling block to unleashing parallelism of applications. Efficient implementations of TM, however, are challenging due to the tension between lowering performance overhead and avoiding unnecessary aborts. In this paper, we present Reachability-based Optimistic Concurrency Control for Transactional Memory (ROCoCoTM), a novel scheme which offloads concurrency control (CC) algorithms, the central building blocks of TM systems, to reconfigurable hardware. To reduce the abort rate, an innovative formalization of mainstream CC algorithms is developed to reveal a common restriction that leads to unnecessary aborts. This restriction is resolved by the ROCoCo algorithm with a centralized validation phase, which can be efficiently pipelined in hardware. Thanks to a high-performance offloading engine implemented in reconfigurable hardware, ROCoCo algorithm results in decreased abort rates and reduced performance overhead. The whole system is implemented on Intel's HARP2 platform and evaluated with the STAMP benchmark suite. Experiments show 1.55x and 8.05x geomean speedup over TinySTM and an HTM based on Intel TSX, respectively. Given the fast-growing deployment of commodity CPU-FPGA platforms, ROCoCoTM paves the way for software programmers to exploit heterogeneous computing resources with a high-level transactional abstraction to effectively extract the parallelism in modern applications. AU - Li, Zhaoshi AU - Liu, Leibo AU - Deng, Yangdong AU - Wang, Jiawei AU - Liu, Zhiwei AU - Yin, Shouyi AU - Wei, Shaojun ID - 16427 KW - pc2-harp-ressources SN - 9781450369381 T2 - Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture TI - FPGA-Accelerated Optimistic Concurrency Control for Transactional Memory ER - TY - CONF AU - Rehlaender, Philipp AU - Grote, Tobias AU - Tikhonov, Sergey AU - Niejende, Hugues AU - Schafmeister, Frank AU - Bocker, Joachim AU - Thiemann, Peter ID - 16433 SN - 9789075815313 T2 - 2019 21st European Conference on Power Electronics and Applications (EPE '19 ECCE Europe) TI - A PCB Integrated Winding Using a Litz Structure for a Wireless Charging Coil ER - TY - CONF AU - Rehlaender, Philipp AU - Schafmeister, Frank AU - Bocker, Joachim AU - Grote, Tobias ID - 16438 SN - 9781728136660 T2 - 2019 IEEE 28th International Symposium on Industrial Electronics (ISIE) TI - Analytical Topology Comparison for a Single Stage On-Board EV-Battery Converter ER - TY - CHAP AU - Rehlaender, Philipp AU - Schroeer, Maik AU - Chadha, Gavneet AU - Schwung, Andreas ID - 16443 SN - 2661-8141 T2 - Proceedings of the International Neural Networks Society TI - Traffic Sign Detection Using R-CNN ER - TY - JOUR AU - Sahai, Tuhin AU - Ziessler, Adrian AU - Klus, Stefan AU - Dellnitz, Michael ID - 16709 JF - Nonlinear Dynamics SN - 0924-090X TI - Continuous relaxations for the traveling salesman problem ER - TY - CONF AU - Pfeifer, Florian AU - Dietrich, André AU - Marten, Thorsten AU - Tröster, Thomas AU - Nacke, Bernard ID - 16793 SN - 978-3-95735-104-3 T2 - Proceedings of 7th International Conference on Hot Sheet Metal Forming of High-Performance Steel TI - Investigation on Inductive Heating of Sheet Metal for an Industrial Hot Stamping Process ER - TY - CONF AU - Striewe, Jan André AU - Thomas, Robert AU - Fischer, Fabian AU - Wiens, Timo AU - Tröster, Thomas ID - 16794 TI - Energieabsorptions- und Versagensverhalten eines automobilen Seitenschwellers mit lokaler Verstärkung aus kohlenstofffaserverstärktem Kunststoff nach Alterung ER - TY - GEN AU - Ahlers, Dominik AU - Tröster, Thomas ID - 16825 TI - Performance Parameters and HIP Routes for additively manufactured titanium alloy Ti6Al4V ER -