Jürgen Becker 0001

dblp:b/JurgenBecker · DBLP profile ↗
← Back
172ranked-venue papers
13as first author
57since 2021 · last 2026
0000-0002-5082-5487ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 148 · 12 first-author · 41 since 2021Software engineering, systems software and programming languages · 32 · 2 first-author · 13 since 2021Artificial intelligence and machine learning · 7 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 5 · 1 first-author · 4 since 2021Security and privacy · 4 · 3 since 2021Human-computer interaction and ubiquitous computing · 4 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Multi-Partner Project: CeCaS Accelerator Design for Efficient Supercomputing in Automotive Systems
abstract
Modern vehicles integrate an increasing amount of computational functionality, driven by the growing complexity of in-vehicle applications. At the same time, automotive system architectures are becoming more centralized, requiring powerful HPC platforms at the core. These platforms must deliver the performance needed for ADAS, AI, and autonomous driving, while also meeting stringent energy efficiency and safety requirements.The CeCaS project addresses these challenges across a wide range of topics and domains of expertise, including processor design in advanced FinFET technology, the transformation of the E/E architecture, and advanced packaging for automotive supercomputing platforms. Within CeCaS, our work focuses on application-specific accelerator design to enable efficient processing of compute-intensive workloads. In this paper, we present our contributions in this area, including the design of hardware accelerators for both conventional and neuromorphic AI workloads, the development and evaluation of representative AI benchmarks, and the use of virtual platforms for early design-space exploration and hardware/software co-design.
Annina Gutermann, Alexey Serdyuk, Fabian Lesniak, Julian Höfer, Hella Toto-Kiesa, Tanja Harbaum, Jürgen Becker 0001, Brian Pachideh, Sven Nitzsche, Moritz Neher, Carmen Weigelt, Jann Krausse, Victor Pazmino Betancourt, Klaus Knobloch, Lukas Groth, Andrija Neskovic, Saleh Mulhem, Mladen Berekovic
DATE7
2026 Multi-Partner Project: A Holistic and Open-Source Approach to Efficient, Secure and Reliable AI Hardware Deployment in DI-EDAI
abstract
Artificial Intelligence (AI) has demonstrated strong capabilities across various domains over the past decade. Edge and specifically mission-critical applications, such as automotive and aerospace, require both high performance and efficiency without compromises in security and reliability. This stems from tightly constrained power consumption, failures that can have catastrophic consequences and devices that may be physically accessible to malicious actors. AI algorithm deployment to hardware also presents significant barriers, requiring specialized knowledge and expensive development tools. The DI-EDAI project aims to offer a holistic approach for connecting high-level AI algorithms with hardware implementations while tackling the aforementioned issues. Unlike other approaches that address individual aspects of the AI deployment flow, we investigate solutions across multiple layers of the design stack. Through our work we develop efficient hardware, map AI algorithms to hardware while simultaneously ensuring security and reliability. Furthermore, we leverage AI-techniques to assist with Electronic Design Automation (EDA) workflows for design optimization, verification and implementation. Our open source approach aims to reduce entry barriers, promote transparency and education, and spark innovation. This paper presents the current state of the DI-EDAI project at midterm, highlighting our latest contributions, identifying limitations in existing state-of-the-art approaches, and outlining ongoing work to address these gaps.
Georgios Sotiropoulos, Felix Frombach, Julian Höfer, Tanja Harbaum, Jürgen Becker 0001, Henrik Iver Thorøe, Vincent Meyers, Mehdi Baradaran Tahoori, Zeynep Demirdag, Mohammed Bakr Sikal, Hassan Nassar, Heba Khdr, Jörg Henkel, Christopher Wolters, Philipp van Kempen, Johannes Geier, Ulf Schlichtmann, Batuhan Sesli, Muhammad Sabih, Jakob Wittmann, Frank Hannig, Jürgen Teich, Lukas Steiner, Norbert Wehn, Mohamed Shelkamy Ali, Philipp Schmitz, Wolfgang Kunz, Stefan Koegler, Georg Sigl
DATE5
2026 Multi-Partner Project: Scheduling-Deployment Workflow for Autonomous RoboRacer Driving Stacks in the HAL4SDV Project
abstract
The European-funded HAL4SDV project aims to advance European solutions in software-defined vehicles by introducing a hardware abstraction layer positioned between executed software and execution units. HAL4SDV includes over 60 partners across 12 countries and receives funding within the Chips Joint Undertaking under Horizon Europe since April 2024 and is coordinated by TTTech Computertechnik. The proposed hardware abstraction layer includes safety-critical scheduling and platform deployment of software tasks, and is motivated by the requirement for abstracted hardware with unified interfaces in centralized automotive architectures.This work presents a correct-by-construction workflow which is developed by academic partners to schedule and deploy periodic software tasks onto diverse execution units. The workflow facilitates the execution of the same task stack on multiple unit architectures and consists of a task model and scheduling algorithm, which is followed by platform deployment for diverse hardware units, ensuring safe execution. In this multi-partner project, a bandwidth regulation unit for hardware accelerators and a RISC-V-based multicore system with tightly coupled memories are used as target platforms.A RoboRacer driving stack is chosen for evaluation, showing the viability of our workflow to schedule autonomous driving functions. To show generalization capability, synthetic task sets are additionally used to validate our deployment workflow.
Matthias Stammler, Henrik Scheidt, Tanja Harbaum, Jürgen Becker 0001, Konstantin Dudzik, Victor Pazmino Betancourt, Federico Gavioli, Paolo Burgio, Arvind Easwaran, Andreas Eckel
DATE4
2026 Reconfigurable Computing Challenge: Real-Time Graph Neural Networks for Online Event Selection in Big Science
abstract
Graph neural networks are increasingly adopted in trigger systems for collider experiments, where strict latency and throughput constraints render deployment on embedded platforms challenging. As detectors move towards higher granularity, the number of inputs per inference increase and FPGA-only solutions face resource bottlenecks. This work presents an end-to-end demonstrator for the real-time deployment of a dynamic Graph Neural Network for the Belle II electromagnetic calorimeter hardware trigger on the AMD Versal VCK190, leveraging both FPGA fabric and AI Engine tiles. We develop a Python-based semi-automated design flow covering operator fusion, partitioning, mapping, spatial parallelization, and kernel-level optimization. Our design achieves a throughput of 2.94 million events per second at an end-to-end latency of 7.15 µs. Compared to the FPGA-only baseline, this represents a 53% throughput improvement while reducing DSP utilization from 99% to 19% at 29% AI Engine tile utilization. To validate the deployment, an interactive visualization pipeline enables real-time monitoring of inference results on the physical demonstrator.
Marc Neu, Frank Baptist, Thomas Lobmaier, Fabio Papagno, Torben Ferber, Jürgen Becker 0001
FCCM6
2025 Special Session - Hardware-Software Co-Design for Machine Learning Systems Made Open-Source
abstract
Chip technologies are crucial for the digital transformation of industry and society. Machine Learning (ML) and Artificial Intelligence (AI) are increasingly shaping both daily life and industrial applications, with AI hardware playing a vital role in enabling efficient and scalable ML deployment. However, significant challenges remain in bridging the gap between ML algorithm development and hardware implementation, particularly for edge ML applications where efficiency, power constraints, and adaptability are critical. In such resource-constrained environments, hardware-software co-design becomes essential to achieve the necessary trade-offs between performance, energy efficiency, and system responsiveness. One of the key bottlenecks in ML hardware development is the lack of seamless integration between ML toolchains and electronic design automation (EDA) tools for hardware synthesis and mapping. Current solutions often require extensive manual optimization and costly proprietary software, limiting accessibility and innovation. Open-source tools can play a transformative role in democratizing ML hardware design, fostering collaboration, and addressing the growing shortage of skilled professionals. This paper covers key aspects of hardware-software co-design for ML systems, such as ML algorithms, hardware design, compiler technologies and system security, with a focus on open-source solutions. We highlight the critical need for open-source toolchains that connect ML model development with hardware synthesis and optimization and present solutions for custom hardware, as well as FPGA accelerators.
Mehdi Baradaran Tahoori, Vincent Meyers, Mahboobe Sadeghipourrudsari, Huashuangyang Xu, Jürgen Becker 0001, Tanja Harbaum, Felix Frombach, Julian Höfer, Georgios Sotiropoulos, Jörg Henkel, Zeynep Demirdag, Heba Khdr, Hassan Nassar, Ulf Schlichtmann, Johannes Geier, Philipp van Kempen, Georg Sigl, Stefan Koegler, Matthias Probst, Jürgen Teich, Frank Hannig, Muhammad Sabih, Batuhan Sesli, Norbert Wehn, Lukas Steiner, Wolfgang Kunz, Mohamed Shelkamy Ali
CODES+ISSS5
2025 Multi-Partner Project: Open-Source Design Tools for Co-Development of AI Algorithms and AI Chips: (Initial Stage)
abstract
Chip technologies are crucial for the digital transformation of industry and society. Artificial Intelligence (AI) is playing an increasingly important role in both our daily lives and in industry. The development of advanced AI chip designs, essential for the successful deployment of AI, is of critical importance for innovation and competitiveness. However, challenges arise from the complexity of hardware development, expensive access to state-of-the-art design tools, and a global shortage of hardware experts. In addition to cost optimization, computational power, and energy consumption, security and trustworthiness are becoming increasingly important. This project aims to address these challenges in AI chip design by enabling efficient hardware development. We are developing a seamless transition between software-based AI model development and optimization, and efficient hardware implementation, while considering security, trustworthiness, and energy efficiency. An open-source approach plays a key role, facilitating access for small and medium-sized enterprises (SMEs) and expanding the community involved in AI chip design to help mitigate the shortage of skilled professionals.
Mehdi Baradaran Tahoori, Jürgen Becker 0001, Jörg Henkel, Wolfgang Kunz, Ulf Schlichtmann, Georg Sigl, Jürgen Teich, Norbert Wehn
DATE2
2025 DSEParted: Co-Optimization of Embedded NPU Architectures and Neural Network Partitioning
abstract
Convolutional Neural Networks (CNNs) have become an essential tool in the domain of vision processing. However, dedicated accelerators are needed for energy-efficient execution of these networks, especially for embedded devices with tight energy constraints. Integrating multiple of these accelerators via chiplets promises a way to scale up the performance of these emerging systems by partitioning a neural network across multiple accelerators. This approach enables the execution of different layers on an accelerator with the best-suited dataflow. However, partitioning a neural network is a non-trivial task, especially when different accelerator architectures must be considered. In this paper, we propose our framework DSEParted, which automates the co-design of network partitioning and hardware architecture optimization. It employs a hierarchical optimization approach to gradually reduce the number of design candidates until an optimal system configuration is found for a partitioned computation of a neural network. We demonstrate that our framework can design a system that, for GoogLeNet, reduces latency by 22.5% when optimizing for latency. In addition, when optimizing for energy, it reduces the system area by 7.9%, with no impact on latency or energy compared to a baseline system. Further, we show that our partitioning-aware pruning strategy can reduce the EDP of the system by up to 49.7% in the case of ResNeXt-50, compared to a strategy that only optimizes the accelerators individually. Through the provided information, designers receive feedback on the efficiency of the full system at an early development stage. Our work is available open source1.1https://github.com/itiv-kit/cnn-parted
Patrick Schmidt 0003, Fabian Kreß, Alexey Serdyuk, Matthias Stammler, Tanja Harbaum, Jürgen Becker 0001
DSD6
2025 Towards a Service-Oriented Infrastructure for Distributed Systems with Heterogeneous AI Accelerators
Marius Kreutzer, Maximilian Kirschner, Jürgen Becker 0001
SEAA3
2025 A Pixel Histogram-Based Safety Mechanism and Fault Detection Methodology for a Robust Image Signal Processor
Julian Höfer, Patrick Schmidt 0003, Hella Toto-Kiesa, Sebastian Höfer, Gregor Schewior, Dietmar Engelke, Karl-Heinz Eickel, Darius Grantz, Tanja Harbaum, Jürgen Becker 0001
ACM Great Lakes Symposium on VLSI10
2025 Evolving Spatially Embedded Recurrent Spiking Neural Networks for Control Tasks
Alexandru Vasilache, Jona Scholz, Yulia Sandamirskaya, Jürgen Becker 0001
ICANN (4)4
2025 ZuSE-KI-Mobil: AI Chip Design Platform for Automotive and Industrial Applications
Shaown Mojumder, Simon Friedrich, Emil Matús, Matthias Lüders, Martin Friedrich, Oliver Renke, Holger Blume, Markus Kock, Gregor Schewior, Darius Grantz, Jens Benndorf, Julian Höfer, Patrick Schmidt 0003, Jürgen Becker 0001, Nael Fasfous, Pierpaolo Morì, Hans-Jörg Vögel, Samira Ahmadifarsani, Leonidas Kontopoulos, Ulf Schlichtmann, Yun-Jin Li, Gerhard P. Fettweis
IEEE Trans. Very Large Scale Integr. Syst.14
2025 Guest Editorial: Selected Papers From IEEE Computer Society Annual Symposium on VLSI (ISVLSI) 2024
Himanshu Thapliyal, Jürgen Becker 0001, Garrett S. Rose, Tosiron Adegbija, Selçuk Köse
IEEE Trans. Very Large Scale Integr. Syst.2
2025 General Compilation and Mixed-Precision Partitioning: A Combined Approach for Adaptive On-Device Learning
Iuliia Topko, Fabian Kreß, Tanja Harbaum, Jürgen Becker 0001
IEEE Trans. Very Large Scale Integr. Syst.4
2024 A Full-System Approach to Multi-Valued Logic Design: (PhD Forum Paper)
abstract
In the evolving Beyond-Moore era, multi-valued logic (MVL) has the potential to extend existing binary systems and optimize circuit performance. The utilization of more than two logic levels enhances information density, resulting in reduced chip area and improved system performance. Emerging technologies might enable to combine MVL with in-memory computing (IMC) which then could serve as an in-memory multi-valued accelerator for data-intensive workloads. Previous approaches to MVL have been limited to isolated considerations of individual problems, often specific to ternary or quaternary implementations, and have not contextualized MVL approaches within the broader system. The integration of MVL within binary systems and the exploration of suitable electronic design automation (EDA) tools have not been adequately explored. Bridging the gap between stand-alone MVL approaches and integration into larger binary systems, we aim to achieve a “Full-System-View” for multi-valued logic incorporating a versatile range of logic values.
Annina Gutermann, Jürgen Becker 0001
ASAP2
2024 XANDAR: An X-by-Construction Framework for Safety, Security, and Real-Time Behavior of Embedded Software Systems
abstract
The safe and secure implementation of increasingly complex features is a major challenge in the development of autonomous and distributed embedded systems. Automated design-time procedures that guarantee the fulfillment of critical system properties are a promising approach to tackle this challenge. In the European project XANDAR, which took place from 2021 to 2023, eight partners developed an X-by-Construction (XbC) design framework to support developers in the creation of embedded software systems with certain safety, security, and real-time properties. The design framework combines a model-based toolchain with a hypervisor-based runtime architecture. It targets modern high-performance hardware, facilitates the integration of machine learning applications, and employs a library of trusted safety and security patterns to reduce the implementation and verification effort. This paper describes the concepts developed during the project, the prototypical implementation of the design framework, and its application in both an automotive and an avionics use case.
Tobias Dörr, Florian Schade, Jürgen Becker 0001, Georgios Keramidas, Nikos Petrellis, Vasilios I. Kelefouras, Michail Mavropoulos, Konstantinos Antonopoulos, Christos P. Antonopoulos, Nikos S. Voros, Alexander Ahlbrecht, Wanja Zaeske, Vincent Janson, Phillip Nöldeke, Umut Durak, Christos Panagiotou, Dimitris Karadimas, Nico Adler, Clemens Reichmann, Andreas Sailer, Raphael Weber, Thomas Wilhelm 0005, Wolfgang Gabler, Katrin Weiden, Xavier Anzuela Recasens, Sakir Sezer, Fahad Siddiqui 0001, Rafiullah Khan, Kieran McLaughlin, Sena Yengec Tasdemir, Balmukund Sonigara, Henry Hui, Esther Soriano Viguer, Aridane Álvarez Suárez, Vicente Nicolau Gallego, Manuel Muñoz Alcobendas, Miguel Masmano Tello
DATE3
2024 EMDRIVE Architecture: Embedded Distributed Computing and Diagnostics from Sensor to Edge
abstract
Future automotive architectures are expected to transition from a network-centric to a domain-centered architecture featuring central compute units. Powerful domain controllers or smart sensors alleviate the load on these central units and communication systems. These controllers execute tasks with varying criticalities on heterogeneous multicore processors, and are ideally capable of dynamically balancing the computing load between the central unit and sensors. Here, Artificial Intelligence (AI) capabilities playa crucial role, as it is in high demand for such an automotive architecture. However, AI still requires specialized accelerators to improve their computation performance. Task-oriented distributed computing with criticalities up to ASIL-D necessitates the development and utilization of specialized methodologies, such as safety, through the isolation and abstraction of low-level hardware concepts. Meanwhile, online monitoring and diagnostics become vital features to detect errors during operation. The EMDRIVE architecture includes methods, components, and strategies to enhance the performance, safety, and security of such distributed computing platforms. The nationally funded EMDRIVE project connects its twelve partners from academia and industry and is currently in its intermediate stage.
Patrick Schmidt 0003, Iuliia Topko, Matthias Stammler, Tanja Harbaum, Jürgen Becker 0001, Rico Berner, Omar Ahmed, Jakub Jagielski, Thomas Seidler, Markus Abel, Marius Kreutzer, Maximilian Kirschner, Victor Pazmino Betancourt, Robin Sehm, Lukas Groth, Andrija Neskovic, Rolf Meyer, Saleh Mulhem, Mladen Berekovic, Matthias Probst, Manuel Brosch, Georg Sigl, Thomas Wild, Matthias Ernst, Andreas Herkersdorf, Florian Aigner, Stefan Hommes, Sebastian Lauer, Maximilian Seidler, Thomas Raste, Gasper Skvarc Bozic, Ibai Irigoyen Ceberio, Albrecht Mayer
DATE5
2024 UNCOVER: Data-Driven Design Support through Continuous Monitoring of Security Incidents
abstract
The seamless and secure integration of subsystems is a pivotal requirement within contemporary automotive development, necessitating the application of design methodologies like the Vee model. While this approach includes dedicated verification steps for the included contexts and provides a high level of assurance that the system will operate correctly under specified conditions, formalizing specifications outside its operational design domain is per definition not included. Additionally, black-box systems like machine learning based functions prove difficulty to test by these traditional methodologies. In this project, we introduce and demonstrate a design workflow combining the Vee model design paradigm with continuous data-driven software engineering. Our workflow assists the continuous, safe and secure development and improvement of consumer vehicle functionality over the product lifecycle. This is achieved through the continuous monitoring of anomalies, as well as system states that deviate from the established design domain. The UNCOVER methodology consists of a continuous reduction in the amount of necessary monitored messages and presents a methodology throughout the entirety of the product lifecycle. We demonstrate our methodology through a simulation and show our automatic generation of monitoring components, and an automated preselection of identified safety or security incidents.
Matthias Stammler, Julian Lorenz, Eric Sax, Jürgen Becker 0001, Matthias Hamann, Patrick Bidinger, Andreas Dewald, Paraskevi Georgouti, Alexios Camarinopoulos, Günter Becker, Klaus Finsterbusch, Maximilian Kirschner, Laurenz Adolph, Carl Philipp Hohl, Maria Rill, Daniel Vonderau, Victor Pazmino Betancourt
DATE4
2024 Automated Polyhedron-based TDMA Schedule Design for Predictable Mixed-Criticality MPSoCs
abstract
The ongoing trend of centralization of functionality and the resulting integration of previously distributed software components in automotive systems leads to mixed-criticality architectures on those resulting central execution platforms. Multiprocessor system-on-chip architectures provide a powerful platform for centralized execution. A major challenge arises in the safe and secure scheduling of software components on those platforms. Real time tasks can be delayed by interfer-ences occurring by simultaneous access onto shared resources. Meeting deadlines and eliminating contention is often guaranteed by using hypervisors or real time operating systems, which provide a runtime environment to enable tasks to meet their respective deadline in mixed-criticality systems. These runtime environments frequently employ TDMA-based scheduling for a predictable and certifiable execution. In this work, we introduce an algorithm creating scheduling tables for TDMA schedulers that support isolation mechanisms in multicore systems. Using a constructive approach, the resulting scheduling tables support mechanisms for parallel access to shared resources and windows for exclusive execution. Our approach is validated by reconstructing previously generated and valid synthetic scheduling tables. We achieve a high success rate in all cases for a processor utilization of up to 80 % with an algorithm runtime of 10 seconds.
Matthias Stammler, Florian Schade, Jürgen Becker 0001
DSD3
2024 Ph.D. Project: Compiler-Driven Hardware/Software Co- Design for Embedded AI
abstract
Ahstract- The increasing computational complexity of AI work-loads has led to the introduction of numerous accelerator archi-tectures. However, these designs often neglect the software tooling necessary to generate optimized mappings. Additionally, future compute architectures are expected to become more heteroge-neous, resulting in additional challenges regarding mapping of tasks to compute units. In this Ph.D. project, a novel methodology to generate compilers with an optimization pipeline for custom hardware accelerators is presented. The foundation of the work is a new Architecture Description Language (ADL) used to capture architectural details necessary for the compilation process. Based on this, simulators on both core and system level are generated that assists in the design of the underlying hardware. Finally, to assist with compilation, a flow to automatically register the new hardware design to a retargetable compiler will be designed. For the optimization pipeline, we focus on two specific aspects: Tensorization to map instruction sequences to the accelerator, and automated scheduling to optimize the execution time and energy.
Patrick Schmidt 0003, Jürgen Becker 0001
FCCM2
2024 Enhanced Accelerator Design for Efficient CNN Processing with Improved Row-Stationary Dataflow
abstract
Efficient on-device inference of convolutional neural networks (CNNs) is becoming one of the key challenges for embedded systems, leading to the integration of specialized hardware accelerators in System-on-Chips (SoCs). Due to the memory-bound nature of convolution workloads, it is essential to optimize CNN accelerators for maximum data re-use to reduce memory bandwidth requirements. The row-stationary (RS) dataflow enhances data re-use in CNN processing by storing a subset of input activations, weights and partial sums locally within the Processing Elements (PEs). However, designs of RS accelerators are not publicly available, and many implementation details remain undisclosed. This paper introduces an open-source implementation of a CNN accelerator with RS dataflow. The complete VHDL source code is provided as well as a simulation environment that enables in-depth analysis of different workloads. We contribute an exploration of various design parameters and evaluate their impact on performance. Furthermore, we present an enhanced dataflow that is optimized for parallel processing of convolutions with a high number of channels. Our optimizations yield a performance improvement of up to 2.3x for convolutional layers of common neural networks. An FPGA prototype of the accelerator design, featuring 70 PEs on the Xilinx UltraScale+ ZCU104 platform, achieves 4.012 GOPS at 100 MHz.
Fabian Lesniak, Annina Gutermann, Tanja Harbaum, Jürgen Becker 0001
ACM Great Lakes Symposium on VLSI4
2024 Migration of Isolated Application Across Heterogeneous Edge Systems
abstract
Distributed computing capabilities at the network’s edge enable new use cases, e.g., smart factories, industrial internet of things, or autonomous mobility systems. While new applications evolve, managing the resources and being capable of integrating and adjusting the execution of tasks in a distributed edge infrastructure is of great importance. For this, applications need to be migrated between different nodes. These migrations must happen without interruption, allowing the system to meet service requirements while fully utilizing all available hardware resources. Therefore, applications should also be executable on all different compute nodes in a heterogeneous edge system without interfering with each other. To this end, applications should be granted only necessary permission, especially when un-trusted applications are integrated into the system. We, therefore, propose a migration method for isolated applications across heterogeneous compute nodes in service-oriented edge architectures. A service-oriented architecture is used to decouple applications, allowing for flexible scheduling. The migration method enables the fast migration of sandboxed applications based on WebAssembly by utilizing a two-stage migration approach. The concept can utilize multiple communication protocols for management and service communication. We have implemented a proof of concept based on the Zenoh1communication protocol. While the time required depends on the communication protocol and the memory size, we achieved migration delays of under 51 milliseconds for smaller applications. By providing a method for fast migration for applications across heterogeneous compute nodes, it is possible for distributed edge infrastructures to run applications independently from each other and adjust the execution node based on changes in the system’s environment. By integrating applications into our framework, they are executed isolated and with strict access control, allowing for easier reuse.
Marius Kreutzer, Maximilian Seidler, Konstantin Dudzik, Victor Pazmino Betancourt, Jürgen Becker 0001
ICFEC5
2024 A Challenge-Based Blended Learning Approach for an Introductory Digital Circuits and Systems Course
abstract
In the early stages of university education, frontal teaching within expansive lecture halls and paper-based assignments predominate. Students often encounter theoretical concepts whose practical relevance only emerges later, if at all. This can lead to reduced student motivation, an increased risk of academic disengagement, and a tendency toward superficial learning.Our newly developed first-semester course on digital circuits and systems employs an innovative approach that combines blended learning and challenge-based learning to address these issues effectively. Throughout the semester, we introduce four challenges, seamlessly integrated with the course lectures, designed to enhance students’ comprehension of the discussed topics. Each challenge presents a concise, well-defined task, tackled by small teams using tools such as circuit simulators, and our automated toolchain allows students to witness their circuit designs in action on FPGAs later.Through this challenge-based methodology, we aim to foster individual problem-solving skills and practical expertise, which we consider to be essential assets for students during their university education and future careers.
Julian Höfer, Michael Gauß, Manuela Adams, Fabian Kreß, Fabian Kempf, Christian Maximilian Karle, Tanja Harbaum, Andreas Barth 0001, Jürgen Becker 0001
ISCAS9
2024 Work in Progress: Predictable Execution of Isolated Real-Time Tasks on Multicore Systems Using the LET Paradigm
abstract
An ongoing trend in the domain of embedded computing systems is the consolidation of functionality on few, high-performance platforms. This development also impacts real-time systems, where a shift to parallel architectures enables meeting the increased throughput demands. On these multicore platforms, memory contention is a central concern regarding time-predictability. Additionally, isolation between tasks is required to limit the impact of faults during run time. We propose a scratchpad memory-based approach to predictable execution that integrates runtime-based isolation mechanisms with an LET-based task model. In order to mitigate interference between cores, each core executes from a local memory, while the data transfers between the local memories and the shared main memory are incorporated into a global, static schedule. Our task execution model is based on the Logical Execution Time (LET) paradigm, which we extend to include explicitly scheduled data transfers similar to the Predictable Execution Model (PREM). The implementation and evaluation of our approach is ongoing and will be evaluated on a custom RISe- 'v, based multicore platform. This novel approach allows for consolidating hard real-time tasks with high demands for functional safety onto a single platform.
Konstantin Dudzik, Maximilian Kirschner, Victor Pazmino Betancourt, Jürgen Becker 0001
RTAS4
2024 Work-in-Progress: Real-Time Neural Network Inference on a Custom RISC-V Multicore Vector Processor
abstract
Neural networks are increasingly used in real-time systems, such as automated driving applications. This requires high-performance hardware with predictable timing behavior. State-of-the-art real-time hardware is limited in memory and compute resources. On the other hand, modern accelerator systems lack the necessary predictability properties, mainly due to interference in the memory subsystem.We present a new hardware architecture with an accompanying compiler-based deployment toolchain to close this gap between performance and predictability. The hardware architecture consists of a multicore vector processor with predictable cores, each with local scratchpad memories. A central management core facilitates access to shared external memory through a static schedule calculated at compile-time. The presented compiler exploits the fixed data flow of neural networks and WCET estimates of subtasks running on individual cores to compute this schedule.Through this approach, the WCET estimate of the overall system can be obtained from the subtask WCET estimates, data transfer times, and access times of the shared memory in conjunction with the schedule calculated by the compiler.
Maximilian Kirschner, Konstantin Dudzik, Jürgen Becker 0001
RTSS3
2023 The ZuSE-KI-Mobil AI Accelerator SoC: Overview and a Functional Safety Perspective
abstract
ZuSE-KI-Mobil (ZuKIMo) is a nationally funded research project, currently in its intermediate stage. The goal of the ZuKIMo project is to develop a new System-on-Chip (SoC) platform and corresponding ecosystem to enable efficient Artificial Intelligence (AI) applications with specific requirements. With ZuKIMo, we specifically target applications from the mobility domain, i.e. autonomous vehicles and drones. The initial ecosystem is built by a consortium consisting of seven partners from German academia and industry. We develop the SoC platform and its ecosystem around a novel AI accelerator design. The customizable accelerator is conceived from scratch to fulfill the functional and non-functional requirements derived from the ambitious use cases. A tape-out in 22 nm FDX-technology is planned in 2023. Apart from the System-on-Chip hardware design itself, the ZuKIMo ecosystem has the objective of providing software tooling for easy deployment of new use cases and hardware-CNN co-design. Furthermore, AI accelerators in safety-critical applications like our mobility use cases, necessitate the fulfillment of safety requirements. Therefore, we investigate new design methodologies for fault analysis of Deep Neural Networks (DNNs) and introduce our new redundancy mechanism for AI accelerators.
Fabian Kempf, Julian Höfer, Tanja Harbaum, Jürgen Becker 0001, Nael Fasfous, Alexander Frickenstein, Hans-Jörg Vögel, Simon Friedrich, Robert Wittig, Emil Matús, Gerhard P. Fettweis, Matthias Lüders, Holger Blume, Jens Benndorf, Darius Grantz, Martin Zeller, Dietmar Engelke, Karl-Heinz Eickel
DATE4
2023 ATLAS: An Approximate Time-Series LSTM Accelerator for Low-Power IoT Applications
abstract
Enabling the use of Deep Neural Networks (DNNs) for time-series-based applications on low-power devices such as wearables opens up a wide range of new features and services. However, inference requires an enormous amount of operations to be performed by the computing platform. In addition, Long Short-Term Memory (LSTM)-based networks require memory to store the internal cell state for future calculations. In this paper, we therefore propose a hardware/software co-design based low-power LSTM hardware accelerator architecture for Internet of Things (IoT) applications called ATLAS. The design is based on approximate computing techniques to reduce the power consumption and inference latency by achieving high accuracy. Exemplary, we investigate the impact of applying our proposed architecture to a DNN for handwriting recognition. Thereby, we can show that the accuracy decreases only slightly when the inference is executed on ATLAS. The low power consumption is achieved by a minimal design requiring 173 LUTs, 67 FFs, one DSP, and one BRAM on a Xilinx FPGA. As a result, ATLAS enables the efficient use of LSTM-based DNNs in IoT devices.
Fabian Kreß, Alexey Serdyuk, Micha Hiegle, Disnebio Waldmann, Tim Hotfilter, Julian Höfer, Tim Hamann, Jens Barth, Peter Kämpf, Tanja Harbaum, Jürgen Becker 0001
DSD11
2023 Automatic Deployment of Embedded Real-Time Software Systems to Hypervisor-Managed Platforms
abstract
The deterministic integration of concurrent functions on shared multicore platforms is a challenging yet important task. Especially in safety-critical environments, hypervisors can be used to achieve time and space partitioning, but their sole application is often insufficient to guarantee deterministic timing and data flow behavior. Considering the growing complexity of modern embedded systems, for example in terms of functionality and mixed-criticality requirements, model-based approaches are a promising starting point to tackle this issue. In this work, we bridge the gap between a model-based behavior specification methodology based on the Logical Execution Time (LET) concept and target platforms running a commercially available bare-metal hypervisor. Therefore, this paper describes a runtime environment that implements LET semantics at the level of hypervisor partitions and a tool-supported design methodology that deploys software to this runtime environment. From a behavior specification provided as a system model with annotated C code, the presented deployment tool generates binary images with guaranteed timing and data-flow behavior for the XtratuM hypervisor. The approach is finally validated by applying it to a Flight Assistance System (FAS) from the avionics domain.
Florian Schade, Tobias Dörr, Alexander Ahlbrecht, Vincent Janson, Umut Durak, Jürgen Becker 0001
DSD6
2023 Mitigating Masking in Automotive Communication Systems: Modeling and Hardware Generation
abstract
The development of self-driving cars and driver-assistance systems necessitates highly interconnected system architectures with increasing communication volume between processing units. Increased communication as well as information exchange between the heterogeneous parts of distributed system architectures contributes to the rising complexity of future cars. Exploiting this complexity, numerous successful attacks on consumer vehicles were presented. These attacks capitalized on masking effects inside the communication structure, created by components acting as bridges between communication interfaces. This results in the obfuscation of information sources, allowing malicious messages to be sent over these communication interfaces. This paper introduces a method to represent and mitigate these masking effects by using a formal model to describe communication architectures. In addition to that, the generation of monitoring components to detect specified suspicious information flows, which signify an attack on the vehicle, is shown. This approach allows the user to model suspicious information flows originating in system parts that are inaccessible and not modifiable, and to generate monitoring components for communication interfaces which the user has access to. To demonstrate the model and generation, a sample in-vehicle network including a Xilinx UltraScale+ MPSoC is described. Generating monitoring components for the FPGA included inside takes up 4,140 look-up tables and 3,769 registers, corresponding to 1.5 % LUTs and 0.7 % registers inside the FPGA.
Matthias Stammler, Matthias Hamann, Tanja Harbaum, Jürgen Becker 0001
DSD4
2023 Work-in-Progress: Integrating WebAssembly into Service-Oriented Architectures for Edge Systems
abstract
Complex edge systems are often structured with service-oriented architectures. Different communications stacks such as MQTT, DDS, or Zenoh are used, hindering reuse of service implementations across systems. One emerging solution for deploying such services is WebAssembly, which enables platform-independent, secure, and low-overhead execution. We propose a concept for integrating Web-Assembly modules into microservice-based architectures using a specialized runtime. This runtime manages the communication between the WebAssembly module and other parts of the system. The runtime for integration of WebAssembly addresses the challenge of reusing service implementations across systems with different communication protocols. At the same time, this provides isolated, safe and secure execution. Both capabilities are central to service-oriented edge systems.
Marius Kreutzer, Maximilian Seidler, Victor Pazmino Betancourt, Jürgen Becker 0001
EMSOFT4
2023 ReLoDAQ: Resource-Efficient, Low-Overhead 200 Gbits-1 Data Acquisition System for 6G Prototyping
abstract
Existing Data Acquisition (DAQ) systems are not suitable for increased data rates of currently proposed 6G systems. They support only unidirectional communication, cannot store large amounts of data, require resource-intensive FPGA implementations due to use of complex transmission protocols or focus only on FPGA-to-FPGA connections. In our work, we therefore introduce a DAQ system based on RFSoC FPGAs and commodity server hardware, using plain Ethernet as communication protocol to reduce complexity and overhead.
Christian Maximilian Karle, Marc Neu, Johannes Pfau, Jan Sperling, Jürgen Becker 0001
FCCM5
2023 SiFI-AI: A Fast and Flexible RTL Fault Simulation Framework Tailored for AI Models and Accelerators
abstract
For AI-based systems in safety-critical domains, it is inevitable to understand the impact of random hardware faults affecting the target hardware accelerators. The high degree of data reuse makes Deep Neural Network (DNN) accelerators susceptible to significant fault propagation and hence hazardous predictions. Therefore, we present SiFI-AI, a simulation framework for fault injection in DNN accelerators. SiFI-AI proposes a hybrid simulation approach combining fast AI inference with cycle-accurate RTL simulation. Time-expensive RTL simulation is only used to accurately target registers in the hardware through condition-based fault injection. This enables to reveal vulnerable DNN layers and the related fault origin. In a resilience study with 1.5~M fault injection experiments, we analyze representative DNNs and a state-of-the-art DNN accelerator to identify vulnerable layers. The study only takes 1.15 days which is 7x faster than state-of-the-art. Our experiments show the high impact of control register faults and that narrow and deep layers are 10x more resilient compared to the wide and shallow layers of a DNN.
Julian Höfer, Fabian Kempf, Tim Hotfilter, Fabian Kreß, Tanja Harbaum, Jürgen Becker 0001
ACM Great Lakes Symposium on VLSI6
2023 A Hardware-Aware Sampling Parameter Search for Efficient Probabilistic Object Detection
Julian Höfer, Tim Hotfilter, Fabian Kreß, Tanja Harbaum, Jürgen Becker 0001
ICVS6
2023 Design Space Exploration on Efficient and Accurate Human Pose Estimation from Sparse IMU-Sensing
abstract
Human Pose Estimation (HPE) to assess human motion in sports, rehabilitation or work safety requires accurate sensing without compromising the sensitive underlying personal data. Therefore, local processing is necessary and the limited energy budget in such systems can be addressed by Inertial Measurement Units (IMU) instead of common camera sensing. The central trade-off between accuracy and efficient use of hardware resources is rarely discussed in research. We address this trade-off by a simulative Design Space Exploration (DSE) of a varying quantity and positioning of IMU -sensors. First, we generate IMU-data from a publicly available body model dataset for different sensor configurations and train a deep learning model with this data. Additionally, we propose a combined metric to assess the accuracy-resource trade-off. We used the DSE as a tool to evaluate sensor configurations and identify beneficial ones for a specific use case. Exemplary, for a system with equal importance of accuracy and resources, we identify an optimal sensor configuration of 4 sensors with a mesh error of 6.03 cm, increasing the accuracy by 32.7 % and reducing the hardware effort by two sensors compared to state of the art. Our work can be used to design health applications with well-suited sensor positioning and attention to data privacy and resource-awareness.
Iris Fürst-Walter, Antonio Nappi, Tanja Harbaum, Jürgen Becker 0001
IROS4
2023 Policy-Based Task Allocation at Runtime for a Self-Adaptive Edge Computing Infrastructure
abstract
Autonomous and distributed Industrial Internet of Things (IIoT) systems are increasingly developed and deployed. They have an enormous demand for resilience and availability. At the same time, they are in a constantly changing system environment. The underlying edge computing infrastructure is characterized by ever increasing processing power and connectivity as well as a high degree of decentralization. To reduce downtime and long redesign loops, self-adaptation capabilities are needed. Automatic reallocation of the executed tasks to the compute nodes is a possible self-adaptation measure. However, the reallocation should be compliant with the different demands, constraints and specifications of the design. At the same time, a major challenge is that the allocation decision should be fast enough to be calculated at runtime. This paper therefore proposes an allocation method that uses demands in the form of policies to compute automatic reallocation at runtime. The integration of the allocation method into runtime is enabled by combining constraint programming, step-wise multi-criteria solution approaches, and resource management at multiple levels. The policy-based allocation method is tested and evaluated in the context of a smart factory site for the function offloading of automated guided vehicles (AGVs) and driverless micromobiles. Our results show that the allocation method is capable of recalculating the allocation during runtime in milliseconds while maintaining design conformity. This enables the system to react to changes in the environment, thereby reducing the downtime of decentralized Industrial Internet of Things systems and increasing availability.
Victor Pazmino Betancourt, Maximilian Kirschner, Marius Kreutzer, Jürgen Becker 0001
ISADS4
2023 A Unified SoC Lab Course: Combined Teaching of Mixed Signal Aspects, System Integration, Software Development and Documentation
abstract
University courses for System-on-Chip (SoC) design mostly focus on particular aspects. Whereas this can provide detailed understanding of these aspects, it neglects system integration specific topics such as crossing digital and analog domains. In addition, many courses skip practical issues and do not teach Electronic Design Automation (EDA) tools. This is reasonable in the context of a specialized course, but omitting these techniques often prevents students from making active use of the learned knowledge in their own projects. In the following, we present our technological platform to teach SoC design in a holistic lab course: The course takes students from writing the first line of Verilog code to advanced digital and analog design. It introduces simulation of digital and analog systems, debugging methods for software and hardware, CPU bus architecture, custom peripherals and driver development. This work is prototyped using Field Programmable Gate Arrays (FPGAs) and later transferred to an ASIC target, covering standard cell synthesis and analog layout. At the end of the semester, students finalize the project with technical documentation writing. The course is built on the design of an audio peripheral, combining all topics in a single real-world system. It enables students to apply theoretical aspects from various lectures in the SoC curriculum in practice and equips them with the skills needed to dive deeper into each of the involved topics on their own.
Johannes Pfau, Richard Leys, Marc Neu, Alexey Serdyuk, Ivan Peric, Jürgen Becker 0001
ISCAS6
2023 Pattern-Based Information Flow Control for Safety-Critical On-Chip Systems
Tobias Dörr, Florian Schade, Jürgen Becker 0001
SAFECOMP3
2023 CNNParted: An open source framework for efficient Convolutional Neural Network inference partitioning in embedded systems
Fabian Kreß, Vladimir Sidorenko, Patrick Schmidt 0003, Julian Höfer, Tim Hotfilter, Iris Fürst-Walter, Tanja Harbaum, Jürgen Becker 0001
Comput. Networks8
2022 AnaCoNGA: Analytical HW-CNN Co-Design Using Nested Genetic Algorithms
abstract
We present AnaCoNGA, an analytical co-design methodology, which enables two genetic algorithms to evaluate the fitness of design decisions on layer-wise quantization of a neural network and hardware (HW) resource allocation. We embed a hardware architecture search (HAS) algorithm into a quantization strategy search (QSS) algorithm to evaluate the hardware design Pareto-front of each considered quantization strategy. We harness the speed and flexibility of analytical HW-modeling to enable parallel HW-CNN co-design. With this approach, the QSS is focused on seeking high-accuracy quantization strategies which are guaranteed to have efficient hardware designs at the end of the search. Through AnaCoNGA, we improve the accuracy by 2.88 p.p. with respect to a uniform 2-bit ResNet20 on CIFAR-10, and achieve a 35% and 37% improvement in latency and DRAM accesses, while reducing LUT and BRAM resources by 9% and 59% respectively, when compared to a standard edge variant of the accelerator. The nested genetic algorithm formulation also reduces the search time by 51% compared to an equivalent, sequential co-design formulation.
Nael Fasfous, Manoj Rohit Vemparala, Alexander Frickenstein, Emanuele Valpreda, Driton Salihu, Julian Höfer, Anmol Singh, Naveen Shankar Nagaraja, Hans-Jörg Vögel, Nguyen Anh Vu Doan, Maurizio Martina, Jürgen Becker 0001, Walter Stechele
DATE12
2022 Towards Reconfigurable Accelerators in HPC: Designing a Multipurpose eFPGA Tile for Heterogeneous SoCs
abstract
The goal of modern high performance computing platforms is to combine low power consumption and high throughput. Within the European Processor Initiative (EPI), such an SoC platform to meet the novel exascale requirements is built and investigated. As part of this project, we introduce an embedded Field Programmable Gate Array (eFPGA), adding flexibility to accelerate various workloads. In this article, we show our approach to design the eFPGA tile that supports the EPI SoC. While eFPGAs are inherently reconfigurable, their initial design has to be determined for tape-out. The design space of the eFPGA is explored and evaluated with different configurations of two HPC workloads, covering control and dataflow heavy applications. As a result, we present a well-balanced eFPGA design that can host several use cases and potential future ones by allocating 1% of the total EPI SoC area. Finally, our simulation results of the architectures on the eFPGA show great performance improvements over their software counterparts.
Tim Hotfilter, Fabian Kreß, Fabian Kempf, Jürgen Becker 0001, Juan Miguel De Haro Ruiz, Daniel Jiménez-González, Miquel Moretó, Carlos Álvarez 0001, Jesús Labarta, Imen Baili
DATE4
2022 XANDAR: Exploiting the X-by-Construction Paradigm in Model-based Development of Safety-critical Systems
abstract
Realizing desired properties “by construction” is a highly appealing goal in the design of safety-critical embedded systems. As verification and validation tasks in this domain are often both challenging and time-consuming, the by-construction paradigm is a promising solution to increase design productivity and reduce design errors. In the XANDAR project, partners from industry and academia develop a toolchain that will advance current development processes by employing a modelbased X-by-Construction (XbC) approach. XANDAR defines a development process, metamodel extensions, a library of safety and security patterns, and investigates many further techniques for design automation, verification, and validation. The developed toolchain will use a hypervisor-based platform, targeting future centralized, AI-capable high-performance embedded processing systems. It is co-developed and validated in both an avionics use case for situation perception and pilot assistance as well as an automotive use case for autonomous driving.
Leonard Masing, Tobias Dörr, Florian Schade, Jürgen Becker 0001, Georgios Keramidas, Christos P. Antonopoulos, Michail Mavropoulos, Efstratios Tiganourias, Vasilios I. Kelefouras, Konstantinos Antonopoulos, Nikos S. Voros, Umut Durak, Alexander Ahlbrecht, Wanja Zaeske, Christos Panagiotou, Dimitris Karadimas, Nico Adler, Andreas Sailer, Raphael Weber, Thomas Wilhelm 0005, Géza Németh, Fahad Siddiqui 0001, Rafiullah Khan, Vahid Garousi, Sakir Sezer, Victor Morales
DATE4
2022 Hardware-aware Partitioning of Convolutional Neural Network Inference for Embedded AI Applications
abstract
Embedded image processing applications like multicamera-based object detection or semantic segmentation are often based on Convolutional Neural Networks (CNNs) to provide precise and reliable results. The deployment of CNNs in embedded systems, however, imposes additional constraints such as latency restrictions and limited energy consumption in the sensor platform. These requirements have to be considered during hardware/software co-design of embedded Artifical Intelligence (AI) applications. In addition, the transmission of uncompressed image data from the sensor to a central edge node requires large bandwidth on the link, which must also be taken into account during the design phase.Therefore, we present a simulation toolchain for fast evaluation of hardware-aware CNN partitioning for embedded AI applications. This approach explores an efficient workload distribution between sensor nodes and a central edge node. Neither processing all layers close to the sensor nor transmitting all uncompressed raw data to the edge node is an optimal solution for each use case. Hence, our proposed simulation toolchain evaluates power and performance metrics for each reasonable partitioning point in a CNN. In contrast to the state of the art, our approach does not only consider the neural network architecture. In the evaluation, our simulation toolchain additionally takes into account hardware components such as special accelerators and memories that are implemented in the sensor node.Exemplary, we show the simulation results for three commonly used CNNs in embedded systems. Thereby, we identify advantageous partitioning points regarding inference latency and energy consumption. With the support of the toolchain, we are able to identify three beneficial partitioning points for FCN ResNet-50 and two for GoogLeNet as well as for SqueezeNet V1.1.
Fabian Kreß, Julian Höfer, Tim Hotfilter, Iris Fürst-Walter, Vladimir Sidorenko, Tanja Harbaum, Jürgen Becker 0001
DCOSS7
2022 Adaptive Exploration Based Routing for Spatial Isolation in Mixed Criticality Systems
abstract
Applications of different criticality are increasingly sharing the same System-on-Chip platform to be cost and resource effective. On such mixed criticality systems, spatial partitioning of resources is a commonly utilized technique to prevent interference between applications. At the communication level, Network-on-Chip (NoC) used in such systems can aid by isolating network traffic within application regions. Topologies that can develop in such partitions can be regular or irregular requiring minimal and non-minimal routing. For the NoC to be flexible and support such varying network parameters, it is desirable that the routing algorithm can support communication for all possible topologies. Here, we investigate a topology agnostic routing algorithm based on Ant Colony Optimization (ACO) metaheuristic. The routing algorithm explores the NoC for feasible paths using special ant packets and discovers paths based on history of already utilized paths and local traffic information. We aim to decrease the exploration time overhead, by proposing an adaptive exploration technique. Compared to the static version, the proposed technique can decrease the exploration time overhead by upto 68% while maintaining comparable latency and throughput.
Nidhi Anantharajaiah, Jürgen Becker 0001
DSD2
2022 A holistic hardware-software approach for fault-aware embedded systems
abstract
Fault detection and fault tolerance are a already crucial part of many embedded systems and will become even more important in the future. Reasons are the increasing complexity of software used in safety-critical environments and the trend to execute software components with varying criticality on the same hardware. We propose a novel approach for a flexible and adaptive fault handling. Our approach combines an adaptive hardware architecture with a flexible runtime environment to detect and handle faults. In this paper, we present the structure of a tile-based many-core architecture with runtime-adaptive lockstep cores and the design of a flexible dataflow software framework utilizing this hardware platform. We demonstrate that the hardware overhead for our adaptive lockstep concept and the hardware requirements of our runtime environment are minor and thus allow the use in embedded systems. Furthermore, we verified the fault detection and correction capabilities of both the hardware and software via a hardware fault injection mechanism. In addition, our runtime evaluation shows promising results for different redundancy concepts. For this purpose, we compare the execution time of software-only and hardware-only redundancy solutions as well as combinations of both with a non-redundant baseline for different benchmark applications.
Fabian Kempf, Christoph Kühbacher, Christian Mellwig, Sebastian Altmeyer, Theo Ungerer, Jürgen Becker 0001
DSD6
2022 Hardware Support for Predictable Resource Sharing in Virtualized Heterogeneous Multicores
abstract
The lack of a predictable resource sharing in heterogeneous multicore systems leads to the need of a deterministic scheduling for shared resources especially in safety critical applications. As model-based design plays an ever-increasing role in the development of applications in these domains, a parameterizable modelling approach is necessary to handle the complexity and improve the efficiency of the developed system. Moreover, virtualization is considered as one of the main technologies to achieve densely integrated systems with high assurance for safety and security. In this work we propose a scheduling approach that allows a deterministic, segregated and efficient management of requests targeting a shared resource in safety critical multicores and can be used to guarantee a certain quality of service. Based on a formal description of our developed scheduling algorithm we demonstrate the possible parameter sets of the algorithm within the design space. Furthermore, we show our evaluation of different scenarios in heterogeneous multicores including their processing latencies.
Timo Sandmann, Jürgen Becker 0001
DSD2
2022 A Behavior Specification and Simulation Methodology for Embedded Real-Time Software
abstract
Safety-critical real-time systems must be carefully designed to guarantee both functional and temporal correctness. State-of-the-art approaches to achieve this are often based on formal notations capturing both the desired functionality and relevant timing properties. This work is concerned with the design of embedded software systems for emerging fields such as the Urban Air Mobility (UAM) sector. In this context, it deals with scenarios that benefit from a less formal programming model, but for which guarantees on functional and timing behavior must still be provided. We propose a concept to specify and simulate the behavior of embedded real-time software in a deterministic manner. It combines the Logical Execution Time (LET) paradigm with a flexible, code-based approach for behavior specification and performs discrete-event (DE) simulations to determine how exactly the designed system responds to given stimuli. We describe this concept, present a reference implementation using Ptolemy II as simulation backend, and discuss its application to a pilot assistance system from the UAM sector.
Tobias Dörr, Florian Schade, Alexander Ahlbrecht, Wanja Zaeske, Leonard Masing, Umut Durak, Jürgen Becker 0001
DS-RT7
2022 PREUNN: Protocol Reverse Engineering using Neural Networks
abstract
The ability of neural networks to universally approximate any function enables them to learn relationships between arbitrary kinds of data. This offers great potential in information security topics such as protocol reverse engineering (PRE), which has seen little usage of neural networks (NNs) so far. In this paper, we provide a novel approach for implementing PRE with solely NNs, demonstrating a simple yet effective reverse engineering of text-based protocols. This approach is modular by design and allows for the exchange of neural network models at any step with better performing models. The architectures used include a convolutional neural network (CNN), an autoencoder (AE), a generative adversarial net (GAN), a long short-term memory (LSTM), and a self-organizing map (SOM). All of these models combine for a new protocol reverse engineering approach. The results show that the widespread application layer protocols HTTP and FTP can successfully be mimicked by artificial intelligen
Valentin Kiechle, Matthias Börsig, Sven Nitzsche, Ingmar Baumgart, Jürgen Becker 0001
ICISSP5
2022 Using Trace Data for Run-Time Optimization of Parallel Execution in Real-Time Multi-Core Systems
abstract
In recent years, multi-core processors are becoming more and more common in embedded systems, offering higher performance than single-core processors and thereby enabling both computationally intensive embedded applications as well as the space-, weight-, and energy-efficient integration of software components. However, real-time applications, for which meeting certain deadlines must be guaranteed, do not profit as much from this transition. This is mainly due to interference between the processing cores of commercial-off-the-shelf multi-core processors at shared resources, hampering the predictability of task execution times. An effective approach to avoid this is running the critical tasks exclusively on one core while pausing execution on all other cores. This, however, reduces the overall system efficiency since parallel execution potential remains unused. In this work we present a novel approach to managing shared and exclusive execution in such systems. By on-line observation of the critical task progress via the on-chip trace infrastructure, we reduce the time of exclusive execution when it is safely possible and thereby increase the overall system efficiency. Using trace information allows for early detection of parallelization potential and does not require modifications to the critical application, which helps avoiding re-certification of the critical application. We present an implementation on a heterogeneous multi-processor system-on-chip using a state-of-the-art hypervisor for critical systems and evaluate its performance. Our results indicate that a performance gain of 37 % to 41 % over approaches focused on exclusive execution can be reached in low-interference situations.
Florian Schade, Timo Sandmann, Jürgen Becker 0001, Henrik Theiling
RTCSA3
2022 XANDAR: A holistic Cybersecurity Engineering Process for Safety-critical and Cyber-physical Systems
abstract
The integration of connected and autonomous technologies in safety-critical and cyber-physical systems offers great potential in the vital application domains of transportation, manufacturing and aerospace. These technological advancements are necessary to meet the increasing demand for intelligent services, as they open doors to new business models by analysing and sharing the generated data. However, where this sharing of mix-critical data and broader connectivity brings opportunities, it simultaneously presents serious cybersecurity and safety risks due to the cyber-physical nature of these systems. Hence, delivering these intelligent services securely, safely, and reliably to its consumers is a complex engineering and design problem. One of the ways to approach this engineering problem is to consider both system functional and non-functional properties (safety, security, reliability) and systematically integrate them across system design and operational life cycle. The XANDAR project investigates this approach and aims to develop holistic software design methods and architectures for safety-critical and cyber-physical systems that guarantee functional and non-functional properties “byconstruction”. This paper focuses on the non-functional aspects of the project and discusses the preliminary work. by presenting the core cybersecurity principles and uses them as a baseline to propose a holistic cybersecurity engineering process. The tasks of the proposed cybersecurity engineering process are also map onto relevant clauses of ISO 21434. In future, proposed work will be integrated into the XANDAR software toolchain and validated for an avionics situation perception pilot assistance and automotive autonomous driving use cases.
Fahad Siddiqui 0001, Rafiullah Khan, Sakir Sezer, Kieran McLaughlin, Leonard Masing, Tobias Dörr, Florian Schade, Jürgen Becker 0001, Alexander Ahlbrecht, Wanja Zaeske, Umut Durak, Nico Adler, Andreas Sailer, Raphael Weber, Thomas Wilhelm 0005, Géza Németh, Victor Morales, Paco Gomez, Georgios Keramidas, Christos P. Antonopoulos, Michail Mavropoulos, Vasilios I. Kelefouras, Konstantinos Antonopoulos, Nikos S. Voros, Christos Panagiotou, Dimitris Karadimas
VTC Spring8
2021 Employing the Concept of Multilevel Security to Generate Access Protection Configurations for Automotive On-Board Networks
abstract
Future automotive on-board networks are expected to integrate various functions on only a few centralized processing platforms. Combined with attack surfaces that originate from the external connectivity of modern vehicles, this turns the design of secure on-board networks into a challenging endeavor. Therefore, we present a formal model to describe both confidentiality and integrity requirements of applications in such a network using security levels. The proposed model is then integrated into an existing design methodology for the automatic configuration of access protection units in MPSoCs. The resulting methodology ensures that the above-mentioned requirements are automatically enforced during runtime and is validated using a safety-critical example scenario from the automotive domain.
Tobias Dörr, Timo Sandmann, Hannes Mohr, Jürgen Becker 0001
DSD4
2021 XANDAR: X-by-Construction Design framework for Engineering Autonomous & Distributed Real-time Embedded Software Systems
abstract
The next generation of networked embedded systems (ES) necessitates rapid prototyping and high performance while maintaining key qualities like trustworthiness and safety. However, development of safety-critical ES suffers from complex software (SW) toolchains and engineering processes. Moreover, the current trend in autonomous systems, which relies on Machine Learning (ML) and AI applications when combined with fail-operational requirements renders the Verification and Validation (V&V) of these new systems a challenging endeavor. Prime examples are Advanced Driver-Assistance Systems (ADAS) that are prone to various safety/security vulnerabilities. The XANDAR project aims at developing a mature SW toolchain (from requirements analysis to the actual code integration on target including V&V) fulfilling the needs of industry for rapid prototyping of interoperable and autonomous ES. Starting from a model-based system architecture, XANDAR will leverage automatic model synthesis and software parallelization techniques to achieve specific non-functional requirements setting the foundation for a novel (real-time, safety-, and security)-by-Construction paradigm.
Jürgen Becker 0001, Leonard Masing, Tobias Dörr, Florian Schade, Georgios Keramidas, Christos P. Antonopoulos, Michail Mavropoulos, Efstratios Tiganourias, Vasilios I. Kelefouras, Konstantinos Antonopoulos, Nikos S. Voros, Umut Durak, Alexander Ahlbrecht, Wanja Zaeske, Christos Panagiotou, Dimitris Karadimas, Nico Adler, Andreas Sailer, Raphael Weber, Thomas Wilhelm 0005, Florian Oszwald, Dominik Reinhardt, Mohamad Chamas, Adnan Bekan, Graham Smethurst, Fahad Siddiqui 0001, Rafiullah Khan, Vahid Garousi, Sakir Sezer, Victor Morales
FPL1
2021 Binary-LoRAX: Low-Latency Runtime Adaptable XNOR Classifier for Semi-Autonomous Grasping with Prosthetic Hands
abstract
Intelligent, semi-autonomous prostheses take ad-vantage of combining autonomous functions and traditional myoelectric control. With the help of visual and environment sensors, intelligent prostheses achieve a level of autonomy which relieves the user from generating elaborate electromyographic (EMG) signals for grasp type and trajectory. To achieve the desired functionality, the semi-autonomous prosthesis must efficiently process the incoming environmental data at a high rate, with low power and high accuracy. In this paper, we propose Binary-LoRAX, a low-latency runtime adaptable classifier for the semi-autonomous grasping task of prosthetic hands. We offload the classification task to an efficient binary neural network accelerator which performs high-throughput XNOR operations on digital signal processing (DSP) blocks. To tailor the classifier’s performance to the current application scenario, we propose a frequency scaling approach which dynamically switches between two modes of operation, high-performance and power-saving. At high-performance, classifications are performed with a low latency of 0.45ms, high-throughput of 4999 FPS and power consumption of ∼ 2.15 W. This enables functions such as object localization and batch classification. Switching to power-saving mode, a latency of 80 ms is maintained, with up to 19% improved classifier battery-life. Our prototypes achieve a high accuracy of up to 99.82% on a 25 class problem from the YCB graspable object dataset.
Nael Fasfous, Manoj Rohit Vemparala, Alexander Frickenstein, Mohamed Badawy, Felix Hundhausen, Julian Höfer, Naveen Shankar Nagaraja, Christian Unger, Hans-Jörg Vögel, Jürgen Becker 0001, Tamim Asfour, Walter Stechele
ICRA10
2021 Towards Policy-based Task Self-Reallocation in Dynamic Edge Computing Systems
abstract
Innovations and novel applications in the area of the Industrial Internet of Things (IIoT) are driven by the technical possibilities of digitalization and edge computing. This leads to rapid advancements and enormous time pressure in the development and operation of new functionalities. Edge computing systems with self-x functionalities are able to react independently to changes in operation and thus mitigate this time pressure problem. The autonomous response during the operation of the self-x system must nevertheless remain compliant with the original system design requirements. A distributed edge computing system has complex requirements in different components and at different levels of the system. This leads to a major challenge when describing these requirements and constraints in such a way that they can be automatically checked and fulfilled during operation. This paper proposes a model-based description of policies that is used as a basis for reallocation of services during operation. The approach was tested and evaluated using an IIoT use case of a camera-based monitoring system for smart construction sites. Our results show that, based on the policy description, it is possible to automatically compute the reallocation when changes occur in the system, without any intervention from the developer. With this self-x capability, the system can remain in operation longer. Overall, this helps to reduce time pressure in the development, deployment and maintenance of new innovations and applications in the field of the Industrial Internet of Things.
Victor Pazmino Betancourt, Bo Liu 0051, Jürgen Becker 0001
INDIN3
2021 Template-Driven and Hardware-Centric Cross-Domain E/E Architecture Simulation
abstract
Due to various trends in the automotive sector, such as autonomous driving and electrification, the number of Electric/Electronic (E/E) components has risen in both hardware and software. This has led to an increase in certification requirements, which cannot be fulfilled without simulation anymore [1]. Different approaches have emerged trying to master this issue. However, for supporting early design decisions in the E/E development, these are either domain-specific or too elaborate. In this paper, we demonstrate an approach to realize early design decisions through a cross-domain simulation of E/E architectures, regarding the environment, scenarios, vehicle physics, the scheduling of software components and the power supply net. We use static E/E architecture hardware models, consisting of Electronic Control Units (ECUs), sensors, actuators and the wiring harness, as the base for the structure of our simulation models. The individual E/E components are linked to parameterizable simulation model templates to facilitate scalable execution. Moreover, scenarios are used for model reduction and supply the simulation model with stimuli. The simulation model is synthesized in an automated manner. For the evaluation, we simulate the power consumption of an electric vehicle, dependent on different loads. It shows that considering hardware aspects in early design phases uncovers errors that would have been noticed much later, e.g. when using virtual Hardware In the Loop (vHIL) methods. We also investigate the scalability of our approach. As E/E architecture modeling tool, we use Vector PREEvision and for the simulation Mathworks Simulink.
Kevin Neubauer, Leonard Masing, Michael Mahl, Jürgen Becker 0001, Max E. Kramer, Clemens Reichmann
RSP4
2021 Fast Resource and Timing Aware Design Optimisation for High-Level Synthesis
abstract
Field-Programmable Gate Arrays (FPGA) are often present in energy-efficient systems, although its non-trivial development flow is an obstacle for massive adoption. High-Level Synthesis (HLS) approaches attempt to mitigate the gap by targetting FPGAs from software languages, however manual tuning is still essential to meet performance demands. We present a high-level design space exploration framework with timing and resource awareness that uses an estimator named Lina to evaluate each design point. Lina is a profiling-based approach that avoids the costly static analyses performed by HLS compilers, allowing a significantly faster exploration of optimisations. Estimations are improved by supporting a continuous range of operating frequencies and by considering resource usage for both floating-point and integer datapaths. For a given set of C kernels, the estimated solutions are among the best 1% for execution time and resource footprint. The exploration of each kernel using Lina was performed on average two orders of magnitude faster than using early HLS compiler reports, and four orders of magnitude faster than fully compiling each design point. By considering the design spaces traversed, our solutions reached 70% of the maximum speed-up achievable. This represents an average speed-up of 14-16× compared to the baseline designs with no optimisations enabled.
André Bannwart Perina, Arthur Silitonga, Jürgen Becker 0001, Vanderlei Bonato
IEEE Trans. Computers3
2021 From MOSFETs to Ambipolar Transistors: Standard Cell Synthesis for the Planar RFET Technology
abstract
Reconfigurable FETs (RFETs) are ambipolar transistors featuring the ability to conduct both electrons and holes, which is often achieved through the use of silicon nanowires or similar gate-all-around topologies. In this article, we present initial results for standard cell synthesis based on our planar RFET device, featuring top-down planar silicon based technology, lower fabrication complexity than nanowire approaches and a high operating temperature robustness. We first introduce the device physics by explaining the structure and the operating principle on device level. We also summarize recent device optimizations to increase drive current and achieve symmetry between N- and P-type conduction. Next to CMOS-style standard cells, we present a reduced transistor count XOR cell and analyze timing. Transient simulations are performed entirely in TCAD to accurately show device performance. Further we describe extraction of relevant parameters of these circuits for usage in synthesis tools and compare our standard cells to a similar 180nmSOI technology. Afterwards we perform timing analysis for a full adder and explore the boundaries of our device with a larger cryptographic accelerator core.
Maximilian Reuter, Johannes Pfau, Tillmann Krauss, Jürgen Becker 0001, Klaus Hofmann
IEEE Trans. Circuits Syst. I Regul. Pap.4
2021 Utilizing and Extending Trusted Execution Environment in Heterogeneous SoCs for a Pay-Per-Device IP Licensing Scheme
abstract
A pay-per-use Intellectual Property (IP) licensing model that can protect IPs from multiple participants will benefit the FPGA IP market and Small to Medium Enterprises (SMEs). Existing protection solutions in modern FPGA devices rely on dedicated decryption engines that use cryptographic keys, which require programming them in a trusted environment. Since designs from multiple participants need protection in a typical licensing scenario, it requires a trusted third party for key programming and encryption tasks. These requirements led to the proposition of several licensing schemes; however, they do not address several security and flexibility challenges. Therefore, in this work, we propose a pay-per-device IP licensing scheme that is secure, less restrictive for the system developer and offers protection against malicious IP cores. The scheme relies on a Security Framework (SFW) that provides a Trusted Execution Environment (TEE), which handles key storage, cryptographic operations, and security monitoring. A device running the SFW can be considered a trusted platform that provides a direct secure path for the IP from its vendor to the device's TEE, where it is decrypted, analyzed and, then configured on the programmable logic.
Nadir Khan, Sven Nitzsche, Asier Garciandia López, Jürgen Becker 0001
IEEE Trans. Inf. Forensics Secur.4
2021 Automatic Floorplanning and Standalone Generation of Bitstream-Level IP Cores
abstract
Partially reconfigurable designs on field-programmable gate array (FPGA) bring an opportunity for developers to license third-party intellectual property (IP) cores. There are multiple IP licensing models that can be used by the FPGA IP market. Their focus is mainly on feasibility and security; however, two major challenges have been ignored by almost all of them. First, both academic or industrial tools do not provide a flow to generate IPs in a standalone environment. Second, these tools only offer manual floorplanning of the IPs, which is both time and performance inefficient. In this work, we present a framework, that can be used by multiple parties to generate different parts of a design independently, that are compatible with each other. It also provides automatic floorplanning based on mixed-integer linear programming (MILP) that considers the distribution of heterogeneous resources in modern FPGAs, with efficient resource utilization as the main objective. The proposed floorplanning is evaluated with benchmarks from the related work. Furthermore, a use case of internal and open-source designs is used for the validation and evaluation of the independent IP generation and the floorplanner.
Nadir Khan, Jorge Castro-Godínez, Shixiang Xue, Jörg Henkel, Jürgen Becker 0001
IEEE Trans. Very Large Scale Integr. Syst.5
2020 WCET-aware Code Generation and Communication Optimization for Parallelizing Compilers
abstract
High performance demands of present and future embedded applications increase the need for multi-core processors in hard real-time systems. Challenges in static multi-core WCET-analysis and the more complex design of parallel software, however, oppose the adoption of multi-core processors in that area. Automated parallelization is a promising approach to solve these issues, but specialized solutions are required to preserve static analyzability. With a WCET-aware parallelizing transformation, this work presents a novel solution for an important building block of a real-time capable parallelizing compiler. The approach includes a technique to optimize communication and synchronization in the parallelized program and supports complex memory hierarchies consisting of both shared and core-private memory segments. In an experiment with four different applications, the parallelization improved the WCET by up to factor 3.2 on 4 cores. The studied optimization technique and the support for shared memories significantly contribute to these results.
Simon Reder, Jürgen Becker 0001
DATE2
2020 A Formal Model for the Automatic Configuration of Access Protection Units in MPSoC-Based Embedded Systems
abstract
Heterogeneous system-on-chip platforms with multiple processing cores are becoming increasingly common in safety-and security-critical embedded systems. To facilitate a logical isolation of physically connected on-chip components, internal communication links of such platforms are often equipped with dedicated access protection units. When performed manually, however, the configuration of these units can be both time-consuming and error-prone. To resolve this issue, we present a formal model and a corresponding design methodology that allows developers to specify access permissions and information flow requirements for embedded systems in a mostly platform-independent manner. As part of the methodology, the consistency between the permissions and the requirements is automatically verified and an extensible generation framework is used to transform the abstract permission declarations into configuration code for individual access protection units. We present a prototypical implementation of this approach and validate it by generating configuration code for the access protection unit of a commercially available multiprocessor system-on-chip.
Tobias Dörr, Timo Sandmann, Jürgen Becker 0001
DSD3
2020 An Approach to Cost-Efficient Fault Tolerance in Inherently Redundant Fail-Operational Systems
abstract
Embedded systems in safety-critical environments are often subject to strict reliability requirements. This holds particularly true for modern fail-operational systems. In order to deliver a guaranteed minimum functionality at all times, these systems are often based on expensive fault tolerance mechanisms. In this work, we consider fail-operational systems with inherent redundancy. This property describes the presence of multiple hardware components, each of which is underutilized to a certain degree and thus able to serve as a fallback for one of the other components. We propose an off-chip fault tolerance mechanism for a pair of inherently redundant execution units that requires no further replication of these expensive resources. The key component of this concept is a lightweight proxy unit that handles faults of one execution unit by dynamically migrating the safety-critical portion of its functionality to its redundant counterpart. We present a prototypical implementation of this concept and evaluate the fault handling time of the resulting system experimentally. The results show that for an exemplary, processor-based control system with 256 bits of internal state, a cycle time of four milliseconds, and 64 bits of payload data that are read from or written to attached devices per cycle, the presented implementation is able to detect the failure of a unit, activate a fallback functionality on the complementary unit, and restore the internal state variables within five milliseconds.
Tobias Dörr, Timo Sandmann, Patrick Friederich, Arnd Leitner, Jürgen Becker 0001
DSD5
2020 Interference-Aware Memory Allocation for Real-Time Multi-Core Systems
abstract
Computing tight upper bounds for the Worst-Case Execution Time (WCET) at design-time is a crucial step when developing hard real-time software. For multi-core processors, however, timing interference between processor cores is a major problem, which may lead to overestimated WCET bounds. This work investigates possible solutions to reduce interference costs using synchronization-based interference models and appropriate memory allocation schemes. An interference-aware Integer Linear Programming (ILP) formulation of the memory allocation problem is presented to optimally map the variables of parallel programs to a set of distributed memory segments. The approach uses a generic model of the hardware platform, such that it applies to a wide range of multi-core targets, including complex Network-on-Chip (NoC) interconnects. A case study with six different platform configurations shows that interference costs can be bounded more tightly using the proposed interference model. An evaluation of the allocation scheme furthermore shows that the optimization approach can reduce interference costs by up to 49%.
Simon Reder, Jürgen Becker 0001
RTAS2
2019 A Secure Framework with Remote Configuration of Intellectual Property
Nadir Khan, Sven Nitzsche, Jürgen Becker 0001
ICISSP3
2018 A WCET-aware parallel programming model for predictability enhanced multi-core architectures
abstract
Increasing performance requirements for cyber-physical systems in real-time applications raise the necessity to migrate to multi-core processor systems. However, commercial of the shelf multi-core systems are often inappropriate for the real-time domain and real-time capable multi-core programming models are rare. In this paper, we present a solution developed within the EU research project ARGO. By means of a predictability-enhanced NoC-based multi-/many-core architecture, we investigate hardware properties that can help to improve the predictability of the platform and the programming model. Both platform and programming model are complemented by a WCET-aware Architecture Description Language (ADL). This enables a certain degree of hardware abstraction while preserving the relevant details for accurate multi-core WCET analysis algorithms. Target platform and programming model are designed to be statically analyzable by multi-core WCET computation tools, that are part of the automated WCET-aware software parallelization tool flow developed in the ARGO project.
Simon Reder, Leonard Masing, Harald Bucher, Timon D. ter Braak, Timo Stripf, Jürgen Becker 0001
DATE6
2018 OpenCL-based Virtual Prototyping and Simulation of Many-Accelerator Architectures
abstract
Heterogeneous architectures featuring multiple hardware accelerators have been proposed as a promising solution for meeting the ever-increasing performance and power requirements of embedded systems. However, the existence of numerous design parameters may result in different architectural schemes and thus in extra design effort. To address this issue, OpenCL-based frameworks have been recently utilized for FPGA programming, to enable the portability of a source code to multiple architectures. However, such OpenCL frameworks focus on RTL design, thus not enabling rapid prototyping and abstracted modeling of complex systems. Virtual Prototyping aims to overcome this problem by enabling the system modeling in higher abstraction levels. This article combines the benefits of OpenCL and Virtual Prototyping, by proposing an OpenCL-based prototyping framework for data-parallel many-accelerator systems, which (a) creates a SystemC Virtual Platform from OpenCL, (b) provides a co-simulation environment for the host and the Virtual Platform, (c) offers memory and interconnection models for parallel data processing, and (d) enables the system evaluation with alternative real number representations (e.g., fixed-point or 16-bit floating-point).
Efstathios Sotiriou-Xanthopoulos, Leonard Masing, Sotirios Xydis, Kostas Siozios, Jürgen Becker 0001, Dimitrios Soudris
ACM Trans. Embed. Comput. Syst.5
2017 WCET-aware parallelization of model-based applications for multi-cores: The ARGO approach
abstract
Parallel architectures are nowadays not only confined to the domain of high performance computing, they are also increasingly used in embedded time-critical systems. The ARGO H2020 project1provides a programming paradigm and associated tool flow to exploit the full potential of architectures in terms of development productivity, time-to-market, exploitation of the platform computing power and guaranteed real-time performance. In this paper we give an overview of the objectives of ARGO and explore the challenges introduced by our approach.
Steven Derrien, Isabelle Puaut, Panayiotis Alefragis, Marcus Bednara, Harald Bucher, Clément David, Yann Debray, Umut Durak, Imen Fassi, Christian Ferdinand, Damien Hardy, Angeliki Kritikakou, Gerard K. Rauwerda, Simon Reder, Martin Sicks, Timo Stripf, Kim Sunesen, Timon D. ter Braak, Nikos S. Voros, Jürgen Becker 0001
DATE20
2017 Energy Efficient Scientific Computing on FPGAs using OpenCL
Dennis Weller, Fabian Oboril, Dimitar Lukarski, Jürgen Becker 0001, Mehdi Baradaran Tahoori
FPGA4
2017 Efficient task spawning for shared memory and message passing in many-core architectures
Aurang Zaib, Thomas Wild, Andreas Herkersdorf, Jan Heisswolf, Jürgen Becker 0001, Andreas Weichslgartner, Jürgen Teich
J. Syst. Archit.5
2016 A Content Adapted FPGA Memory Architecture with Pattern Recognition Capability for L1 Track Triggering in the LHC Environment
abstract
Modern high-energy physics experiments such as the Compact Muon Solenoid experiment at CERN produce an extraordinary amount of data every 25ns. To handle a data rate of more than 50Tbit/s a multi-level trigger system is required, which reduces the data rate. Due to the increased luminosity after the Phase-II-Upgrade of the LHC, the CMS tracking system has to be redesigned. The current trigger system is unable to handle the resulting amount of data after this upgrade. Because of the latency of a few microseconds the Level 1 Track Trigger has to be implemented in hardware. State-of-the-art pattern recognition filter the incoming data by template matching on ASICs with a content addressable memory architecture. An implementation on an FPGA, which replaces the content addressable memory of the ASIC, has not been possible so far. This paper presents a new approach to a content addressable memory architecture, which allows an implementation of an FPGA based design. By combining filtering and track finding on an FPGA design, there are many possibilities of adjusting the two algorithms to each other. There is more flexibility enabled by the FPGA architecture in contrast to the ASIC. The presented design minimizes the stored data by logic to optimally utilize the available resources of an FPGA. Furthermore, the developed design meets the strong timing constraints and possesses the required properties of the content addressable memory.
Tanja Harbaum, Mahmoud Seboui, Matthias Norbert Balzer, Jürgen Becker 0001, Marc Weber
FCCM4
2016 High-Speed Medical Imaging in 3D Ultrasound Computer Tomography
abstract
A promising candidate for sensitive imaging of breast cancer is 3D Ultrasound Computer Tomography (3D USCT). So far its clinical applicability for diagnosis has been limited by the duration of the demanding image reconstruction. In this paper we investigate how signal processing and image reconstruction can be accelerated for diagnosis by using heterogeneous hardware. Additionally, the time and costs for real-time system for a future diagnosis and therapy device is estimated. Reusing the device's built-in FPGA-based data acquisition system (DAQ) through reconfiguration results in a speed-up by a factor of 7 for signal processing and by a factor of 2 for image reconstruction. Applying cutting-edge single FPGAs and GPUs, speed-ups by a factor of 10 (FPGA) and 6 (GPU) for signal processing and 15 (FPGA) and 37 (GPU) for image reconstruction were achieved compared to a recent quad-core Intel Core-i7 CPU. Using quad-core CPUs and a cluster of eight GPUs allowed us for the first time to calculate volumes in less than 30 min with an overall speed-up by a factor of 47, enabling a first clinical study. Based on these results we extrapolated that real-time reconstruction for a therapeutic 3D USCT will be possible in the year 2020 if the trend in density follows the ITRS roadmap.
Matthias Birk, Ernst Kretzek, Peter Figuli, Marc Weber, Jürgen Becker 0001, Nicole V. Ruiter
IEEE Trans. Parallel Distributed Syst.5
2015 A Distributed Simulation Platform Using HLA for Complex Embedded Systems Design
abstract
Design complex embedded systems demands method and tools that allow the simulation and verification in an efficient and practical way. This paper proposes the development and evaluation of a distributed simulation platform of heterogeneous simulators based on High Level Architecture (HLA), a middleware for distributed discrete event simulation, in order to create an environment with high-performance execution of large-scale, heterogeneous and complex embedded systems. However, integrate hybrid systems is not trivial, because there is no guarantee that two systems that perfectly work separately will work well together. Experimental results of five different scenarios are presented, which integrate five different simulations tools: Ptolemy II, SystemC, Omnet++, Veins, Stage (a Robot Operating System compatible simulator) and physical robots. The experiments show success in application of Wireless Sensor Networks (WSN), power estimation of circuit design, robotic simulation and co-simulation of real robots.
Alisson Vasconcelos de Brito, Harald Bucher, Helder F. de A. Oliveira, Luís Feliphe Silva Costa, Oliver Sander, Elmar U. K. Melcher, Jürgen Becker 0001
DS-RT7
2015 Power Estimation of an ECDSA Core Applied in V2X Scenarios Using Heterogeneous Distributed Simulation
abstract
Embedded systems are steadily growing in complexity and nowadays power consumption additionally plays an important role. Designing and exploring such systems embedded in its environment demand for holistic and efficient simulations. In this work we use a simulation framework based on the HLA (High-Level Architecture) and the modeling tool Ptolemy II to enable complex heterogeneous distributed simulations of embedded systems. In this context, we introduce a co-simulation based power estimation approach by integrating domain-specific simulators as well as off-the-shelf HDL simulator and synthesis tools. This enables cross-domain interaction and generation of realistic on-the-fly stimuli data for Register Transfer Level and Gate Level models as well as the gathering of power estimation data. We apply the framework to a Vehicle-2-X scenario evaluating an ECDSA signature processing core which ensures trustworthiness in vehicular wireless networks. To evaluate dynamic power reduction possibilities on application level we additionally introduce a V2X Message Evaluation technique to reduce signature verification efforts. It shows how realistic on-the-fly stimuli data obtained by the framework can improve the exploration and estimation of dynamic power consumption.
Harald Bucher, Alexander Klimm, Oliver Sander, Jürgen Becker 0001
DS-RT4
2015 Software-in-the-Loop simulation of embedded control applications based on Virtual Platforms
abstract
One challenge in developing complex software for embedded systems is the missing option of rapid prototyping in early stages of the development cycle. In this paper we present the use of the High Level Simulation Framework “Open Virtual Platforms” (OVP) for Software-in-the-Loop simulation of embedded control applications. Therefore, we investigate and evaluate different methods allowing the data exchange between the simulated platform and the host machine running the simulation environment. The insights we gain are used to design peripherals which appear to the simulated processor system like devices available on the targeted hardware platform and allow the access to files stored on the host machine on one hand, and the communication with hardware devices connected to the host on the other hand. In both cases the cross-compiled application code for the targeted embedded platform including the operating system (OS) and the hardware abstraction layer (HAL) can be executed by the virtual platform (VP) without any modifications. Additionally, we introduce a method for controlling the synchronization of OVP with the host, which can be used to either run simulations in fast motion mode, or to collaborate with hardware devices or other applications. The approach is verified with two use cases: (1) a motor control application processing data by accessing files and (2) an image processing application interacting with real hardware devices directly coupled with the virtual platform.
Stephan Werner 0002, Leonard Masing, Fabian Lesniak, Jürgen Becker 0001
FPL4
2014 CAP: Communication Aware Programming
abstract
Networks on Chip (NoC) come along with increased complexity from the implementation and management perspective. This leads to higher energy consumption and programming complexity of NoC architectures.
Jan Heisswolf, Aurang Zaib, Andreas Zwinkau, Sebastian Kobbe, Andreas Weichslgartner, Jürgen Teich, Jörg Henkel, Gregor Snelting, Andreas Herkersdorf, Jürgen Becker 0001
DAC10
2014 Hardware virtualization support for shared resources in mixed-criticality multicore systems
abstract
Electric/Electronic architectures in modern automobiles evolve towards an hierarchical approach where functionalities from several ECUs are consolidated into few domain computers. Performance requirements directly lead to multicore solutions but also to a combination of very different requirements on such ECUs. Using virtualization in addition is one promising way of achieving segregation in time and space of shared resources. Based on examples taken from the automotive domain several concepts for efficient hardware extensions of coprocessors and I/O devices are shown in this contribution. These provide mechanisms to ensure quality of service (QoS) levels in terms of execution time, throughput and latency. The resulting infotainment architecture is a feasibility study and is integrated into a vehicle demonstrator as centralized infotainment platform (VCT).
Oliver Sander, Timo Sandmann, Viet Vu Duy, Steffen Bähr, Falco Bapp, Jürgen Becker 0001, Hans-Ulrich Michel, Dirk Kaule, Daniel Adam, Enno Lübbers, Jürgen Hairbucher, Andre Oliver Richter, Christian Herber, Andreas Herkersdorf
DATE6
2014 Adaptive Algorithm and Tool Flow for Accelerating System C on Many-Core Architectures
abstract
Within this paper an adaptive approach for parallel simulation of SystemC RTL models on future many-core architectures like the Single-chip Cloud Computer (SCC) from Intel is presented. It is based on a configurable parallel SystemC kernel that preserves the partial order defined by the SystemC delta cycles while avoiding global synchronization as far as possible. The underlying algorithm relies on a classification of existing communication relations between parallel processes. The type and topology of communication relations determines the type and number of causality conditions that need to be fulfilled during runtime. The parallel kernel is complemented by an automated tool flow that allows detecting relevant model-specific properties, performing a fine-grained model partitioning, classifying communication relations and configuring the kernel. Experiments by means of a MPSoC model show, that pure local synchronization can provide significant performance gains compared to global synchronization. Furthermore, the combination of local synchronization with fine-grained partitioning provides additional degrees of freedom for optimization.
Christoph Roth, Simon Reder, Harald Bucher, Oliver Sander, Jürgen Becker 0001
DSD5
2014 A flexible interface architecture for reconfigurable coprocessors in embedded multicore systems using PCIe Single-root I/O virtualization
abstract
Especially in complex system-of-systems scenarios, where multiple high-performance or real-time processing functions need to co-exist and interact, reconfigurable devices together with virtualization techniques show considerable promise to increase efficiency, ease integration and maintain functional and non-functional properties of the individual functions. In this paper, we propose a flexible interface architecture with low overhead for coupling reconfigurable coprocessors to high-performance general-purpose processors, allowing customized yet efficient construction of heterogeneous processing systems. Our implementation is based on PCI Express (PCIe) and optimized for virtualized systems, taking advantage of the SR-IOV capabilities in modern PCIe implementations. We describe the interface architecture and its fundamental technologies, detail the services provided to individual coprocessors and accelerator modules, and quantify key corner performance indicators relevant for virtualized applications.
Oliver Sander, Steffen Bähr, Enno Lübbers, Timo Sandmann, Viet Vu Duy, Jürgen Becker 0001
FPT6
2014 A Hierarchical Architecture Description for Flexible Multicore System Simulation
abstract
As processors and systems on chip in the embedded world increasingly become multicore, parallel programming remains a difficult, time-consuming and complicated task. End users who are not parallel programming experts have a need to exploit such processors and architectures, using high level programming languages, like Scilab or MATLAB. The ALMA toolset solves this problem: it takes Scilab code as input and produces parallel code for embedded multiprocessor systems on chip, using platform quasi-agnostic optimizations. The platform information is provided by an architecture description language designed for the purpose of a flexible system description as well as simulation. A hierarchical system description in combination with a parameterizable simulation environment allows fine-grained trade-offs between simulation performance and simulation accuracy.
Thomas Bruckschlögl, Oliver Wolf, Michael Rückauer, Timo Stripf, Jürgen Becker 0001
ISPA5
2014 SmartLoCore: A Concept for an Adaptive Power-Aware Localization Processor
abstract
During the last decades, a great shift to processing on mobile and ubiquitous devices has been taken place. With this movement also the integration of different sensors, especially inertial sensors, has gained strong interest. One approach is to combine inertial sensors with other localization systems. However, this needs real-time processing capabilities and low power consumption, which is usually a problem when performing this task on the main processor with the operating system on top. In this paper, we present an adaptive localization processor called SmartLoCore including an intuitive development flow that allows hardware/software co-design trade-offs during design-time. These options include running the algorithm in software, adding new additional instructions to the core instruction-set and off-loading complex mathematics onto dedicated hardware. We show the applicability with a complex localization application example and highlight the benefits of the proposed concept. We conclude that the SmartLoCore concept shows a very promising potential for a large variety of mobile systems.
Carsten Tradowsky, Tobias Gädeke, Thomas Bruckschlögl, Wilhelm Stork, Klaus D. Müller-Glaser, Jürgen Becker 0001
PDP6
2014 GPU-based iterative transmission reconstruction in 3D ultrasound computer tomography
Matthias Birk, Robin Dapp, Nicole V. Ruiter, Jürgen Becker 0001
J. Parallel Distributed Comput.4
2013 Hybrid interconnect design for heterogeneous hardware accelerators
abstract
The communication infrastructure is one of the important components of a multicore system along with the computing cores and memories. A good interconnect design plays a key role in improving the performance of such systems. In this paper, we introduce a hybrid communication infrastructure using both the standard bus and our area-efficient and delay-optimized network on chip for heterogeneous multicore systems, especially hardware accelerator systems. An adaptive data communication-based mapping for reconfigurable hardware accelerators is proposed to obtain a low overhead and latency interconnect. Experimental results show that the proposed communication infrastructure and the adaptive data communication-based mapping achieves a speed-up of 2.4× with respect to a similar system using only a bus as interconnect. Moreover, our proposed system achieves a reduction of energy consumption of 56% compared to the original system.
Cuong Pham-Quoc, Jan Heisswolf, Stephan Werner 0002, Zaid Al-Ars, Jürgen Becker 0001, Koen Bertels
DATE5
2013 Coarse-Grain Optimization and Code Generation for Embedded Multicore Systems
abstract
As processors and systems-on-chip increasingly become multicore, parallel programming remains a difficult, time-consuming and complicated task. End users who are not parallel programming experts have a need to exploit such processors and architectures, using state of the art fourth generation of high programming languages, like Scilab or MATLAB. The ALMA toolset addresses this problem by receiving Scilab code as input and produces parallel code for embedded multiprocessor systems on chip, using platform quasi-agnostic optimisations. In this paper, coarse grain parallelism extraction and optimization issues as well as parallel code generation for the ALMA toolset are discussed.
George Goulas, Christos Valouxis, Panayiotis Alefragis, Nikos S. Voros, Christos Gogos, Oliver Wolf, Timo Stripf, Thomas Bruckschlögl, Jürgen Becker 0001, Ali El Moussawi, Maxime Naullet, Tomofumi Yuki
DSD9
2013 Concurrent Error Detection in Multipliers by Using Reduced Wordlength Multiplication and Logarithms
abstract
Checking multiplication by using logarithms has already been proposed in literature but until now it has not been used widely in practice nor have different implementations been evaluated or compared. In this paper we will analyse the error detection capability of different implementations of logarithmic checking. Based on the results we propose a new way of checking multiplication. It uses normalised and word length reduced operands which are multiplied by a smaller multiplier in order to estimate the result of the multiplier to be checked. The estimated result is compared to the result of the multiplier by the difference of their base 2 logarithms. This approach enables the use of inaccurate approximations for the base 2 logarithm computation and improves error detection compared to standard logarithmic checking. The error detection capability can be adjusted to the application's need for error detection by choosing the word length of the normalised operands. The error detection capability and the hardware overhead of this method are compared with the ones of known logarithmic checking methods.
Alexander Uhl, Jürgen Becker 0001
DSD2
2013 AUTO-GS: Self-Optimization of NoC Traffic through Hardware Managed Virtual Connections
abstract
Networks-on-Chip have shown their scalability for future many-core systems on chip. In real world scenarios, where multiple applications are being executed over a shared NoC based platform, efficient utilization of Networks-on-Chip resources becomes challenging. Methodologies are required to ensure better utilization of NoC, especially in the scenarios, where the communication patterns of NoC traffic are difficult to predict before run-time. In this paper, we propose a self-optimization mechanism which detects frequent communication by monitoring communication patterns at run-time and uses this information to establish virtual connections autonomously. Communication monitoring and connection establishment are realized in hardware. Hardware managed virtual connections lead to better utilization of NoC resources and reduce the communication latencies suffered by applications. In addition, energy consumption by the communication infrastructure is reduced. The proposed concept is investigated through simulation of real world application scenarios. The simulation results highlight the performance improvement and synthesis results show the low area overhead of the proposed hardware implementation.
Aurang Zaib, Jan Heisswolf, Andreas Weichslgartner, Thomas Wild, Jürgen Teich, Jürgen Becker 0001, Andreas Herkersdorf
DSD6
2013 Development and Evaluation of Distributed Simulation of Embedded Systems Using Ptolemy and HLA
abstract
Nowadays, embedded systems have a huge amount of computational power and consequently, high complexity. It is quite usual to find different applications being executed in embedded systems. Embedded system design demands for method and tools that allow the simulation and verification in an efficient and practical way. This paper proposes the development and evaluation of a solution for embedded modeling and simulation of heterogeneous Models of Computation (MoCs) in a distributed way by the integration of Ptolemy II and the High Level Architecture (HLA), a middleware for distributed discrete event simulation, in order to create an environment with high-performance execution of large-scale heterogeneous models. Experimental results demonstrate, that the use of a non distributed simulation for some situations can be infeasible, as well as the use of distributed simulation with few machines, like one, two or three computers. It was demonstrated that a speedup of factor 4 was acquired when a model with 4,000 thousands actors were distributed in 8 different machines.
Alisson Vasconcelos de Brito, Angelo V. Negreiros, Christoph Roth, Oliver Sander, Jürgen Becker 0001
DS-RT5
2013 A platform-independent runtime methodology for mapping multiple applications onto FPGAs through resource virtualization
abstract
Field programmable Gate Arrays (FPGAs) promise a low power flexible alternative for implementing parallel applications. Compared to CPUs and GPUs, they suffer from slow development cycles due to the high complexity of application development and hardware incompatibilities. Towards this direction, we propose a platform-independent methodology and the supporting framework targeting efficient run-time application mapping onto FPGAs. Experimental results show that the introduced solution performs application placement and routing of multiple applications without any performance penalty as compared to state of art tools. Scalability of the framework was verified by mapping up to 73 applications per minute when it is executed on an 8 core system.
Harry Sidiropoulos, Peter Figuli, Kostas Siozios, Dimitrios Soudris, Jürgen Becker 0001
FPL5
2013 QUKU: A dual-layer reconfigurable architecture
abstract
A new architecture, QUKU, is proposed for implementing stream-based algorithms on FPGAs, which combines the advantages of FPGA and Coarse Grain Reconfigurable Arrays (CGRAs). QUKU consists of a dynamically reconfigurable, coarse-grain Processing Element (PE) array with an associated softcore processor providing system support. At a coarse-grain, the PE array can be reconfigured on a cycle-by-cycle basis to change the PE functionality similarly to that in a conventional CGRA. At a fine-grain, the whole FPGA can be reconfigured statically to implement a completely different PE array that serves the target application in a better way. Advantages of the fine-grain reconfiguration include individually customized PEs, adaptable numeric format support and customizable interconnect network. A prototype CAD tool framework is also developed which facilitates programming the QUKU architecture. An example application consisting of two different image detectors is implemented to demonstrate the advantages of QUKU. QUKU provides up to 140 times speedup and 40 times improvement in area-time product compared to an implementation running on an FPGA-based softcore. The area-time product for QUKU is around 16% lower than that of a custom circuit based implementation on the same FPGA. The per-PE customization provides an area-time saving of approximately 31% compared to a homogeneous 4 × 4 array of PEs for the same application. The experimental results demonstrate that a dual layered reconfigurable architecture provides significant potential benefits in terms of flexibility, area and processing efficiency over existing reconfigurable computing architectures for DSP.
Neil W. Bergmann, Sunil Shukla, Jürgen Becker 0001
ACM Trans. Embed. Comput. Syst.3
2013 Reliable and adaptive network-on-chip architectures for cyber physical systems
abstract
Reliability in embedded systems is crucial for many application domains. Especially, for safety critical application, as they can be found in the automotive and avionic domain, a high reliability has to be ensured. The technology in chip production undergoes a steady shrinking process from nowadays 25 nanometers. It is proven that coming technologies, which are much smaller, can have a higher defect rate after production, but also at runtime. The physical effects at runtime come from a higher susceptibility for radiation. Since the silicon die of a field programmable gate array (FPGA) includes a high amount of physical wiring, the radiation effect plays here a major role. Therefore, this article describes an approach of a reliable Network-on-Chip (NoC) which can be used for an FPGA-based system. The article describes the concept and the physical realization of this NoC and evaluates its reliability.
Diana Göhringer, Lukas Meder, Oliver Wolf, Jürgen Becker 0001
ACM Trans. Embed. Comput. Syst.4
2013 MORPHEUS: A heterogeneous dynamically reconfigurable platform for designing highly complex embedded systems
abstract
Recently, system designers are facing the challenge of developing systems that have diverse features, are more complex and more powerful, with less power consumption and reduced time to market. These contradictory constraints have forced technology providers to pursue design solutions that will allow design teams to meet the above design targets. In that respect, this paper introduces an innovative technology platform, called MORPHEUS, which intents to provide complete design framework for dealing with the aforementioned challenges. MORPHEUS consists of a state of the art architecture that encompasses heterogeneous reconfigurable accelerators for implementing on the same hardware architecture applications with varying characteristics and a tool chain that, through a software oriented approach, eases the implementation of highly complex applications with heterogeneous characteristics. The proposed approach has been tested and evaluated through state of the art cases studies borrowed from complementary application domains.
Nikos S. Voros, Michael Hübner 0001, Jürgen Becker 0001, Matthias Kühnle, Florian Thoma, Arnaud Grasset, Paul Brelet, Philippe Bonnot 0001, Fabio Campi, Eberhard Schüler, Henning Sahlbach, Sean Whitty, Rolf Ernst, Enrico Billich, Claudia Tischendorf, Ulrich Heinkel, Frank Ieromnimon, Dimitrios Kritharidis, Axel Schneider, Joachim Knäblein, Wolfram Putzke-Röming
ACM Trans. Embed. Comput. Syst.3
2013 Virtual networks - distributed communication resource management
Jan Heisswolf, Aurang Zaib, Andreas Weichslgartner, Ralf König 0001, Thomas Wild, Jürgen Teich, Andreas Herkersdorf, Jürgen Becker 0001
ACM Trans. Reconfigurable Technol. Syst.8
2013 JITPR: A framework for supporting fast application's implementation onto FPGAs
Harry Sidiropoulos, Kostas Siozios, Peter Figuli, Dimitrios Soudris, Michael Hübner 0001, Jürgen Becker 0001
ACM Trans. Reconfigurable Technol. Syst.6
2012 Hardware prototyping of novel invasive multicore architectures
abstract
The sustained advance in technology will enable integrating hundreds of processing cores on a single die in near future. However, it already can be foreseen that the management of the resources of such large systems will not scale in the same way as the hardware using todays entirely software based and centralized management approaches. The invasive paradigm addresses this problem and proposes concepts to enable resource awareness and scalability - especially focusing the resource management perspective - in future multicore systems. These concepts are based on distributed and software-hardware partitioned resource management strategies. High level management decision that are made by software thereby trigger lower level management strategies that are autonomously carried out in hardware. Sufficiently accurate modeling of the overall invasive system is required to study and optimize such a decentralized, software-hardware partitioned control loop where decisions significantly depend on runtime dynamic effects. Software based simulation cannot deliver the required speed or accuracy making FPGA based prototyping of invasive systems necessary. This paper describes our prototyping concepts and discusses possible implementation alternatives for invasive multicore architectures.
Jürgen Becker 0001, Stephanie Friederich, Jan Heisswolf, Ralf König 0001, David May 0003
ASP-DAC1
2012 On demand dependent deactivation of automotive ECUs
abstract
We describe details of a technology under development that allows selective deactivation of electronic control units in automotive networks as a means to increase a vehicle's energy efficiency: intelligent communication controllers. In particular, we provide details on an ICC's estimated energy savings potential, prove by experiment that ICCs are unique enablers for deactivation of FlexRay ECUs, and describe a prototypical implementation.
Christoph Schmutzler, Martin Simons 0001, Jürgen Becker 0001
DATE3
2012 A cycle-approximate, mixed-ISA simulator for the KAHRISMA architecture
abstract
Processor architectures that are capable to reconfigure their instruction set and instruction format dynamically at run time offer a new flexibility exploiting instruction level parallelism vs. thread level parallelism. Based on the characteristics of an application or thread the instruction set architecture (ISA) can be adapted to increase performance or reduce resource/power consumption. To benefit from this run-time flexibility automatic selection of an appropriate ISA for each function of a given application is envisioned. This demands a cycle-accurate simulator that is capable of measuring the performance characteristics of an ISA dependent on the target application. However, simulation speed of a cycle-accurate simulator of our reconfigurable VLIW-like processor instances featuring dynamic operation execution would become relatively slow due to the superscalar-like microarchitecture. Within this paper we address this problem by presenting our cycle-approximate simulator approach containing a heuristic dynamic operation execution and memory model that provides a good trade-off between performance and accuracy. Additionally, the simulator features measurement of instruction level parallelism (ILP) that could be theoretically exploited by VLIW processor instances running on our architecture. The theoretical ILP could be used as an indicator for the ISA selection process without the need to simulate any combination of the different ISAs and applications.
Timo Stripf, Ralf König 0001, Jürgen Becker 0001
DATE3
2012 Virtualized on-chip distributed computing for heterogeneous reconfigurable multi-core systems
abstract
Efficiently managing the parallel execution of various application tasks onto a heterogeneous multi-core system consisting of a combination of processors and accelerators is a difficult task due to the complex system architecture. The management of reconfigurable multi-core systems which exploit dynamic and partial reconfiguration in order to, e.g. increase the number of processing elements to fulfill the performance demands of the application, is even more complicated. This paper presents a special virtualization layer consisting of one central server and several distributed computing clients to virtualize the complex and adaptive heterogeneous multi-core architecture and to autonomously manage the distribution of the parallel computation tasks onto the different processing elements.
Stephan Werner 0002, Oliver Wolf, Diana Göhringer, Michael Hübner 0001, Jürgen Becker 0001
DATE5
2012 From Scilab to High Performance Embedded Multicore Systems: The ALMA Approach
abstract
The mapping process of high performance embedded applications to today's multiprocessor system on chip devices suffers from a complex tool chain and programming process. The problem here is the expression of parallelism with a pure imperative programming language which is commonly C. This traditional approach limits the mapping, partitioning and the generation of optimized parallel code, and consequently the achievable performance and power consumption of applications from different domains. The Architecture oriented paraLlelization for high performance embedded Multicore systems using scilAb (ALMA) European project aims to bridge these hurdles through the introduction and exploitation of a Scilab-based toolchain which enables the efficient mapping of applications on multiprocessor platforms from high level of abstraction. This holistic solution of the toolchain allows the complexity of both the application and the architecture to be hidden, which leads to a better acceptance, reduced development cost, and shorter time-to-market. Driven by the technology restrictions in chip design, the end of exponential growth of clock speeds, and an unavoidable increasing request of computing performance, ALMA is a fundamental step forward in the necessary introduction of novel computing paradigms and methodologies.
Jürgen Becker 0001, Timo Stripf, Oliver Wolf, Michael Hübner 0001, Steven Derrien, Daniel Ménard, Olivier Sentieys, Gerard K. Rauwerda, Kim Sunesen, Nikolaos Kavvadias, Kostas Masselos, George Goulas, Panayiotis Alefragis, Nikos S. Voros, Dimitrios Kritharidis, Nikolaos Mitas, Diana Göhringer
DSD1
2012 Framework for dynamic verification of multi-domain virtual platforms in industrial automation
abstract
A crucial part in the development of embedded systems in the industrial automation domain is their verification using simulation-based techniques. A comprehensive set of domain-specific modeling and simulation tools are available for this purpose, but they can only focus on certain aspects of a design. This paper presents a co-simulation framework for bringing them together in a structured and standardized way. The results are multi-domain virtual platforms where overall dynamic verification is possible. The advantage of multi-domain simulation models becomes clear when one recalls that embedded systems are used to interface with a physical environment. Often, they are coupled and cannot be tested in separation. Having a framework where physical and digital domains can interact in a correct and reproducible manner opens up new possibilities for embedded system developers. We demonstrate the capabilities of our framework by adding a co-simulation scheme between SystemC and the VHDL-AMS simulator SMASH, and present its application in an industrial case study for the verification of a new Rogowski Current Coil Transducer (RCCT) electronic front end architecture and its embedded controller software algorithm.
Francisco Mendoza 0001, Joris Pascal, Philipp Nenninger, Jürgen Becker 0001
INDIN4
2012 A Scalable NoC Router Design Providing QoS Support Using Weighted Round Robin Scheduling
abstract
Networks on Chip are the most promising approach to cope with communication requirements in future many core SoCs. Depending on the executed applications, communication requirements may vary at run-time. Dynamic reservation of communication resources in virtual channel NoCs is an encouraging approach for connection-oriented communication guaranteeing QoS. This paper presents a concept enhancing virtual channel reservation to support different bandwidth and latency guarantees. The used weighted round robin scheduling provides hard guarantees regarding throughput and latency. The proposed router design enables dynamic sharing of communication resources between connectionless Best Effort and connection-oriented Guaranteed Service traffic. Due to decentralized routing and resource management it offers a very good scalability for future many core architectures. Simulation results are obtained from a 10x10 NoC with a cycle accurate SystemC router model. The presented results are compared to existing round robin arbitration schemes and show the advantage of the proposed concept. Synthesis results expose its low area overhead.
Jan Heisswolf, Ralf König 0001, Jürgen Becker 0001
ISPA3
2011 Fast Start-up for Spartan-6 FPGAs using Dynamic Partial Reconfiguration
abstract
This paper introduces the first available tool flow for Dynamic Partial Reconfiguration on the Spartan-6 family. In addition, the paper proposes a new configuration method called Fast Start-up targeting modern FPGA architectures, where the FPGA is configured in two-steps, instead of using a single (monolithic) full device configuration. In this novel approach, only the timing-critical modules are loaded at power-up using the first high-priority bitstream, while the non-timing critical modules are loaded afterwards. This two-step or prioritized FPGA start-up is used in order to meet the extremely tight startup timing specifications found in many modern applications, like PCI-express or automotive applications. Finally, the developed tool flow and methods for Fast Start-up have been used and tested to implement a CAN-based automotive ECU on a Spartan-6 evaluation board (i.e., SP605). By using this novel approach, it was possible to decrease the initial bitstream size and hence, achieve a configuration time speed-up of up to 4.5×, when compared to a standard configuration solution.
Joachim Meyer 0001, Juanjo Noguera, Michael Hübner 0001, Lars Braun, Oliver Sander, R. M. Gil, Rodney Stewart, Jürgen Becker 0001
DATE8
2011 Run-Time Resource Allocation for Simultaneous Multi-tasking in Multi-core Reconfigurable Processors
abstract
State-of-the-art multi-core reconfigurable processors do not exploit the full potential of simultaneous multi-tasking with run-time adaptive reconfigurable fabric allocation. We propose a novel run-time system for simultaneous multi-tasking in a multi-core reconfigurable processor that adaptively allocates the mixed-grained reconfigurable fabric resource at run time among different tasks considering their performance constraints. Our scheme employs the novel concept of refined task-criticality (based on the functional-block-level performance constraints) considering the computational properties of dependent tasks and their inherent potential for acceleration. Our scheme dynamically compensates the deadline misses at the functional block level. It thereby reduces the potential task-level deadline misses under competing scenarios. With the help of a secure video conferencing application (with 4 dependent tasks of diverse computational properties), we demonstrate that our scheme reduces the deadline misses by (on average) 6× under given performance constraints, when compared to state-of-the-art reconfigurable processors.
Waheed Ahmed, Muhammad Shafique 0001, Lars Bauer, Manuel Hammerich, Jörg Henkel, Jürgen Becker 0001
FCCM6
2011 RAMPSoCVM: Runtime Support and Hardware Virtualization for a Runtime Adaptive MPSoC
abstract
Virtualizing complex hardware, such as heterogeneous multiprocessor systems, enables developers to use standard Application Programming Interfaces (APIs) for application integration. Especially, the supply of an Operating System (OS) is well appreciated since many features such as drivers, the runtime environment and scheduling mechanisms are available and well established. For this purpose, Embedded Linux was used as basis OS and extended in order to be able to manage a Runtime Adaptive Multi-Processor System-on-Chip (RAMPSoC) and to provide the standard Message Passing Interface (MPI). This paper describes the adaptation of the Linux kernel supporting MPI with runtime libraries as well as the integration of the software/hardware drivers which supply the message transfer over a reconfigurable and heterogeneous Network-on-Chip (NoC).
Diana Göhringer, Stephan Werner 0002, Michael Hübner 0001, Jürgen Becker 0001
FPL4
2011 Embedded Systems Start-Up under Timing Constraints on Modern FPGAs
abstract
In this paper we present novel techniques, methods and tool flows that enable embedded systems implemented on FPGAs to start-up under tight timing constraints (i.e., hard deadlines). Meeting the application deadline is achieved by exploiting the FPGA programmability in order to implement a two-stage system start-up approach, as well as a suitable memory hierarchy. This reduces the FPGA configuration time as well as the startup time of the embedded software. Thereby the start-up time for timing-critical parts of a design neither dependent on the complexity nor on the start-up time of the complete system. An automotive case study is used to demonstrate the feasibility and quantify the benefits of the proposed approach.
Joachim Meyer 0001, Juanjo Noguera, Michael Hübner 0001, Rodney Stewart, Jürgen Becker 0001
FPL5
2011 A FPGA based fast runtime reconfigurable real-time Multi-Object-Tracker
abstract
This paper presents a real-time Multi-Object-Tracker implemented on a Field Programmable Gate Array (FPGA). This system is able to track three objects simultaneously using different algorithms to get the best result. Each algorithm has its own field of application and the user can decide which algorithm is used for individual objects. Using the dynamic, partial reconfiguration capability of Xilinx FPGAs, the algorithms can be exchanged during runtime without interrupting the object-tracking. To obtain a self reconfigurable system the Internal Configuration Access Port (ICAP) is used. In this application the needed time to exchange the algorithms has to be as short as possible. In this paper we present a design to achieve the theoretical maximum throughput of the ICAP of 400 MB/s.
Matthias Rümmele-Werner, Thomas Perschke, Lars Braun, Michael Hübner 0001, Jürgen Becker 0001
ISCAS5
2011 Digital On-demand Computing Organism - Interaction between Monitoring and Middleware
abstract
Organic Computing is a vital and promising research area. Inspired by nature, organic computing research wants to learn and adopt from techniques and properties of nature. The goal is to acquire the so called self-X properties like self-organization and self-healing. The DodOrg project introduces such an organic computing system for real-time applications, a whole new computing system from the bottom to the top. In this paper, we present the interaction between organic middleware and monitoring. Our results showed very promising results and only a small overhead for monitoring and the artificial hormone system based middleware.
Alexander von Renteln, Uwe Brinkschulte, David Kramer, Wolfgang Karl, Christian Schuck, Jürgen Becker 0001
ISORC6
2010 KAHRISMA: A novel Hypermorphic Reconfigurable-Instruction-Set Multi-grained-Array architecture
abstract
Facing the requirements of next generation applications, current approaches of embedded systems design will soon hit the limit where they may no longer perform efficiently. The unpredictable nature and diverse processing behavior of future applications requires to transgress the barrier of tailor-made, application-/domain-specific embedded system designs. As a consequence, next generation architectures for embedded systems have to react much more flexible to unforeseeable run-time scenarios. In this paper we present our innovative processor architecture concept KAHRISMA (KArlsruhe's Hypermorphic Reconfigurable-Instruction-Set Multi-grained-Array). It tightly integrates coarse- and fine-grained run-time reconfigurable fabrics that can incorporate to realize hardware acceleration for computationally complex algorithms. Furthermore, the fabrics can be combined to realize different Instruction Set Architectures that may execute in parallel. With the help of an encrypted H.264 en-/decoding case study we demonstrate that our novel KAHRISMA architecture will deliver the required flexibility to design future-proof embedded systems that are not limited to a certain computational domain.
Ralf König 0001, Lars Bauer, Timo Stripf, Muhammad Shafique 0001, Waheed Ahmed, Jürgen Becker 0001, Jörg Henkel
DATE6
2010 Scenario extraction for a refined timing-analysis of automotive network topologies
abstract
In the past few years, many research groups have presented methods which are very valuable for analytically evaluating the timing behavior of automotive electric/electronic (E/E) systems. From an industrial perspective (view of an OEM), the novelty of this topic leads to a situation where the necessary input data for timing analysis is partially not specified or not available in an appropriate manner. Therefore, this paper presents a methodology for a systematic extraction of periodic and sporadic events in order to refine the input data for subsequent timing analysis. Our experimental results obtained with a real-world E/E-system points out the impact of the contribution.
Matthias Traub, Thilo Streichert, Oleg Krasovytskyy, Jürgen Becker 0001
DATE4
2010 A Design Methodology for Application Partitioning and Architecture Development of Reconfigurable Multiprocessor Systems-on-Chip
abstract
Until today, the efficient partitioning and mapping of applications for multiprocessor systems is a challenging task. The deployment of reconfigurable hardware in this domain helps to meet the application requirements more efficiently due to hardware adaptation at design and runtime, which is not applicable in the traditional multiprocessor domain. To exploit this novel degree of freedom in multiprocessor system-on-chip (MPSoC) technology, a novel design methodology is needed, which helps to hide the complexity of the hardware architecture and its realization alternatives from the developer. This paper shows one approach for such a design methodology for the development of the hardware architecture and the application partitioning and mapping. A novel multistep approach based on hierarchical clustering is used for partitioning of the software application and for configuration of a runtime adaptive multiprocessor system. Furthermore, each application module is then partitioned in a Hardware-Software Codesign process in order to achieve a maximum of performance on the local processors and therefore in general for the MPSoC.
Diana Göhringer, Michael Hübner 0001, Michael Benz, Jürgen Becker 0001
FCCM4
2010 A semi-automatic toolchain for reconfigurable multiprocessor systems-on-chip: architecture development and application partitioning (abstract only)
abstract
S.286
Diana Göhringer, Michael Hübner 0001, Michael Benz, Jürgen Becker 0001
FPGA4
2010 Reconfigurable Hardware for Power-over-Fiber Applications
abstract
In this paper we present an optically powered and motorized video camera system. Energy for the camera sensor is supplied by a glass fiber carrying 800 mW of optical power, which the sensor converts back to 320 mW of electrical power. The specific advantage of this arrangement is galvanic isolation and a very high robustness with respect to electromagnetic interference. We demonstrate that sufficient energy can be transmitted for driving an Actel Igloo FPGA, which performs the necessary signal processing. Additionally, with the help of capacitive energy storage, some small actuators can be supplied which move the camera sensor head. The base station of the system, based on a Xilinx Virtex-5 FPGA, holds a LEON-3 based system-on-chip encoding the incoming VGA video stream into Motion-JPEG formatted data in realtime, which may be directly sent to the internet using an Ethernet interface. The prototype has numerous fields of application where it performs much better than stateof-the-art solutions. Most prominent examples are visual sensors in high voltage areas as well as medical endoscopes.
Michael Dreschmann, Michael Hübner 0001, Moritz Röger, Oliver Sander, Christos Klamouris, Jürgen Becker 0001, Wolfgang Freude, Juerg Leuthold
FPL6
2010 Design Assurance Strategy and Toolset for Partially Reconfigurable FPGA Systems
abstract
The growth of the Reconfigurable Computing (RC) systems community exposes diverse requirements with regard to functionality of Electronic Design Automation (EDA) tools. Low-level design tools are increasingly required for RC bitstream debugging and IP core design assurance, particularly in multiparty Partially Reconfigurable (PR) designs. While tools for low-level analysis of design netlists do exist, there is increasing demand for automated and customisable bitstream analysis tools. This article discusses the need for low-level IP core verification within PR-enabled FPGA systems and reports FDAT (FPGA Design Analysis Tool), a versatile, modular and open tools framework for low-level analysis and verification of FPGA designs. FDAT provides a set of high-level Application Programming Interfaces (APIs) abstracting the Xilinx FPGA fabric, the implemented design (e.g., placed and routed netlist) and the related bitstream. A lightweight graphic front-end allows custom visualisation of the design within the FPGA fabric. The operation of FDAT is governed by “recipe” scripts which support rapid prototyping of the abstract algorithms for system-level design verification. FDAT recipes, being Python scripts, can be ported to embedded FPGA systems, for example, the previously reported Secure Reconfiguration Controller (SeReCon) which enforces an IP core spatial isolation policy in order to provide run-time protection to the PR system. The paper illustrates the application of FDAT for bit-pattern analysis of Virtex-II Pro and Virtex-5 inter-tile routing and verification of the spatial isolation between designs.
Krzysztof Kepa, Fearghal Morgan, Krzysztof Kosciuszkiewicz, Lars Braun, Michael Hübner 0001, Jürgen Becker 0001
ACM Trans. Reconfigurable Technol. Syst.6
2010 Guest Editorial ARC 2009
abstract
No abstract available.
Roger F. Woods, Jürgen Becker 0001, Peter M. Athanas, Fearghal Morgan
ACM Trans. Reconfigurable Technol. Syst.2
2009 Priority-based packet communication on a bus-shaped structure for FPGA-systems
abstract
We present an application tailored packed-based SoC communication system with one-hop communication between all entities, priority-based arbitration, broadcast and multicast support on a bus-shaped basis. It is located as a hybrid between NoC and bus approaches, closing the gap for mostly streaming-based systems with the need for highly flexible communication patterns and multicast messages that are below a certain size. The system is implemented and evaluated on a FPGA within a car-to-car communication gateway application.
Oliver Sander, Benjamin Glas, Christoph Roth, Jürgen Becker 0001, Klaus D. Müller-Glaser
DATE4
2009 Dynamic reconfigurable mixed-signal architecture for safety critical applications
abstract
Current trends show, it is increasingly difficult to manage the constraints of costs, power consumption, size and more than everything else, functional safety, with conventional architectures. This paper presents a new architecture to deal with the current and upcoming requirements in safety critical applications. It proposes the use of diverse redundancy with digital and analog channels, to detect random hardware failures as well as systematic failures. That will increase the functional safety. By exploiting the ability of dynamic and partial hardware reconfiguration of FPGA and FPAA and by using the appropriate failure recovery scenario, the system availability can also be increased. Furthermore, the architecture offers the possibility to combine high accuracy with short response time.
Romuald Girardey, Michael Hübner 0001, Jürgen Becker 0001
FPL3
2009 Star-Wheels Network-on-Chip featuring a self-adaptive mixed topology and a synergy of a circuit - and a packet-switching communication protocol
abstract
Multiprocessor System-on-Chip is a promising realization alternative for the next generation of computing architectures providing the required data processing performance in high performance computing applications. Numerous scientists from industry and academic institutions investigate and develop novel processing elements and accelerators as can be seen in real devices like IBM's Cell or nVIDIA's Tesla GPU. Nevertheless, the on-chip communication of these multiple processor elements has to be optimized tailored to the actual requirement of the data to be processed. Network-on-Chip (NoC), Bus-based or even heterogeneous communication on chip often suffer from the fact of being inflexible due to their fixed physical realization. This paper presents a novel approach for a NoC, exploiting circuit-and packed-switched communication as well as a run-time adaptive and heterogeneous topology. An application scenario from image processing exploiting the implemented NoC on an FPGA delivers results like performance data and hardware costs.
Diana Göhringer, Michael Hübner 0001, Jürgen Becker 0001
FPL4
2009 Design of a Vehicle-to-Vehicle communication system on reconfigurable hardware
abstract
Vehicle-to-vehicle communication (V2VC) promises to be a next major step towards safe and efficient road traffic. This contribution presents a V2V communication system on FPGA-basis. It provides a flexible and modular hardware framework for various software-implemented V2V applications and routing algorithms. Exploiting the benefits of reconfigurable hardware the system manages to provide hardware acceleration for security processing and data preprocessing while at the same time being adaptive to traffic situations, different environment and evolving standards and applications. We present the overall structure of the system, detail modules and communication system and present special mechanisms used to exploit FPGA benefits. Finally we give results concerning performance values and resource usage.
Oliver Sander, Benjamin Glas, Christoph Roth, Jürgen Becker 0001, Klaus D. Müller-Glaser
FPT4
2009 A MicroBlaze specific co-processor for real-time hyperelliptic curve cryptography on Xilinx FPGAs
abstract
A Hardware/Software Codesign approach based on a MicroBlaze softcore processor and a GF2n-coprocessor module to form a minimal hardware architecture for HECC on low-cost Xilinx FPGAs is described in this paper. Exploiting the features of the MicroBlaze's integrated interfaces instructions are streamed on-demand to the coprocessor to keep the controlflow highly flexible. At the same time the dataflow between hardware and software is minimized. Comparison with previous architectures shows high acceleration of HECC with minor increase in hardware resources. It is demonstrated that this speed-up can be used for countermeasures on algorithmic level against basic side-channel attacks while still keeping real-time constraints.
Alexander Klimm, Oliver Sander, Jürgen Becker 0001
IPDPS3
2009 Car-to-Car Communication Security on Reconfigurable Hardware
abstract
To get more information about oncoming road and traffic situations, exchange of data between cars is a large benefit. But relying on data obtained from other cars and hence sensors not under direct control of the system, guaranteeing trustworthiness and integrity of this data is of paramount importance. This creates the need for security measures for the data exchange which impose high computational demands to achieve the low latencies needed for safety applications. In this contribution we present a hardware security module allowing efficient calculation and verification of signatures. Implementation as well as integration aspects are being discussed in this paper.
Benjamin Glas, Oliver Sander, Vitali Stuckert, Klaus D. Müller-Glaser, Jürgen Becker 0001
VTC Spring5
2008 Design Flows, Communication Based Design and Architectures in Automotive Electronic Systems
abstract
Summary form only given. The complete presentation was not made available for publication as part of the conference proceedings. A steadily increasing number of microprocessors and electronic components with the heavy demand of computation performance in automotive electronic systems affect substantially the design of networked ECUs in today as well as future cars. Novel approaches, based on heterogeneous hardware (Coarse- fine Grained reconfigurable Hardware, Microprocessors) could be a solution to handle the computation intensive tasks, e.g. for driver-assistance systems. The challenge here is to find an optimal trade-off between power consumption, cost, performance and flexibility which leads to the question which technology and which distribution (automotive function centralisation - decentralisation trade-offs!) will be targeted in future car electronics. Introducing novel architecture topologies and corresponding tool flows with standardised specification and verification are here severe challenges. A first approach to meet these challenges is the AUTOSAR development partnership, which aims at a standardisation of automotive software architecture. The purpose of this tutorial is to evaluate and discuss new concepts for communication based design of automotive electronic and car network systems, as well as to discuss and envisage future system design in automotive electronics. Both aspects, hardware / software design and tool-integration will be discussed. The main emphasis in this session is design-flow, tool-development, applications and system design. The tutorial is addressed to hardware and system engineers as well as to researchers. A set of presentations intended to set the stage for the discussion, will be followed by a panel where selected world-wide specialists in the field of automotive electronics will discuss the demands and interests of industry on novel technologies and systems and research activities for future automotive systems.
Jürgen Becker 0001, Michael Hübner 0001, Robert Esser, Andreas Herkersdorf, Walter Stechele, Vera Lauer
DATE1
2008 Design of a HW/SW Communication Infrastructure for a Heterogeneous Reconfigurable Processor
abstract
Reconfigurable architectures and NoC (Network-on-Chip) have introduced new research directions for technology and flexibility issues, which have been largely investigated in the last decades. Exploiting run-time adaptivity opens a new area of research by considering dynamic reconfiguration. In this paper, we present the architecture and associated development tools of an heterogeneous reconfigurable SoC focusing on the chosen communication infrastructure. The SOC integrates units of various sizes of reconfiguration granularity. The included NoC approach demonstrates the mentioned benefits and scalability for actual and future SoC design. On a reference CMOS090 implementation the described interconnect system works at the system reference frequency of 200 MHZ sustaining the required run-time bandwidth on a set of reference applications, at a price ≪ 10% in area in power consumption with respect to the overall system.
Antonio Deledda, Claudio Mucci, Arseni Vitkovski, Philippe Bonnot 0001, Arnaud Grasset, Philippe Millet, Matthias Kühnle, Florian Ries, Michael Hübner 0001, Jürgen Becker 0001, Massimo Coppola, Lorenzo Pieralisi, Riccardo Locatelli, Giuseppe Maruccia, Fabio Campi, Tommaso DeMarco
DATE10
2008 A System Architecture for Reconfigurable Trusted Platforms
abstract
For improving the security of embedded systems, trusted computing is a promising technology. For the area of microprocessors in general and personal computers in particular the Trusted Computing Group (TCG) has published detailed specifications. The resulting hardware has been available for some years. This contribution discusses the feasibility of deploying ideas from trusted computing in the domain of reconfigurable hardware, esp. FPGAs, and possible benefits and drawbacks. We give a proposal to use actually available FPGA technology to build a trusted platform on reconfigurable hardware. We also show how trusted computing can deal with partial dynamic reconfiguration while still allowing the user to fully exploit its potentials.
Benjamin Glas, Alexander Klimm, Oliver Sander, Klaus D. Müller-Glaser, Jürgen Becker 0001
DATE5
2008 A Novel Recursive Algorithm for Bit-Efficient Realization of Arbitrary Length Inverse Modified Cosine Transforms
abstract
In this paper a novel approach for inverse modified cosine transform (IMDCT) computation is presented, based on a recursive algorithm. Due to its nature, this IMDCT calculation can be performed on a reduced bit width datapath without loss of accuracy, compared to alternative recursive architectures. Combined with the regular structure, the approach allows for a much more area efficient VLSI implementation compared to existing systems. Due to its bit efficiency this approach is attractive to be implemented on reconfigurable architectures of the DSP domain as well.
Ralf König 0001, Timo Stripf, Jürgen Becker 0001
DATE3
2008 Cost-and Power Optimized FPGA based System Integration: Methodologies and Integration of a Low-Power Capacity-based Measurement Application on Xilinx FPGAs
abstract
The application of field programmable gate arrays (FPGAs) in low power and low cost industrial mass products has become an important issue for designers of electronic systems. The flexibility and performance offered by reconfigurable hardware architectures often stands in the opposite to increased power consumption in comparison to application specific integrated circuit (ASIC) solutions. By exploiting the flexibility of reconfigurable hardware architectures, e.g. the capability of run-time HW reconfiguration of some modern FPGA devices, power consumption of FPGA-based solutions can be further decreased. This paper presents an approach for cost- and power optimized system integration of a low-power capacity-based measurement system by exploiting the dynamic and partial reconfiguration capability of Xilinx FPGAs.
Katarina Paulsson, Michael Hübner 0001, Jürgen Becker 0001
DATE3
2008 Combining Rewriting-Logic, Architecture Generation, and Simulation to Exploit Coarse-Grained Reconfigurable Architectures
abstract
In recent years, many coarse-grained reconfigurable architectures have been proposed as programmable accelerators for general purpose processors. The processing elements (PEs) of such architectures mainly differ on the computations they can directly support. Although different PEs and different interconnect resources among them are usually justified by the results presented, there have been few generic approaches able to exploit different PE computing structures while maintaining the same compilation flow. This paper shows our recent achievements concerning a design space exploration tool for an array of coarse-grained PEs. Our approach uses Rewriting Logic to map computations described by imperative software programming languages to the PEs of the target architecture, a VHDL generation step to prototype the architectures being exploited and a clock cycle-based simulator in order to achieve first assessments about the performance of the exploited architectures. Our approach can retarget different PE’s structures and complexities, and can be used to evaluate design solutions. In order to show the potential of our approach, we present results on exploiting a 1-D coarse-grained reconfigurable array as an accelerator and the effects of different PE’s structures and complexities.
Carlos Morra, João Bispo, João M. P. Cardoso, Jürgen Becker 0001
FCCM4
2008 Fine grain reconfigurable architectures
abstract
In this booth on fine grain reconfigurable architectures, several research groups demonstrate their joint work on operating concepts for managing dynamic and partial reconfiguration, visualization of bitstreams and routing, presenting an application applying dynamic reconfiguration for video engines as well as work on minimization of reconfiguration data. Unique is that all the above four projects present their work using the same reconfigurable FPGA-based fabric called Erlangen slot machine that has also been built within one project just the purpose of experimenting with dynamic fine grain reconfiguration as an interdisciplinary platform.
Josef Angermeier, Mateusz Majer, Jürgen Teich, Lars Braun, Tobias Schwalb, Philipp Graf, Michael Hübner 0001, Jürgen Becker 0001, Enno Lübbers, Marco Platzner, Christopher Claus, Walter Stechele, Andreas Herkersdorf, Markus Rullmann, Renate Merker
FPL8
2008 Data path driven waveform-like reconfiguration
abstract
The Xilinx Virtex FPGA family provides the capability to perform dynamic partial hardware reconfiguration (DPR). This implies that parts of the system can by dynamically reprogrammed while the rest of the system components continue their execution without being interrupted. Such reconfigurable FPGA systems are becoming more and more common for applications that require a high degree of run-time flexibility. One major research task in this area is to decrease the overhead caused by the reconfiguration duration. This can be done by increasing the reconfiguration rate, which means increasing the system performance when performing the reconfiguration. This paper presents an alternative approach which aims at decreasing the influence of the reconfiguration, by carefully dividing the reconfigurable modules according to the specific data graph and to start processing the data while the following parts of the data graph are still being reconfigured. This prevents data from being stalled and waiting for the reconfiguration to complete. The suggested approach is referred to as waveform-like reconfiguration, since the data processing closely follows the reconfiguration process.
Lars Braun, Katarina Paulsson, Herrmann Krömer, Michael Hübner 0001, Jürgen Becker 0001
FPL5
2008 A multi-platform controller allowing for maximum Dynamic Partial Reconfiguration throughput
abstract
Dynamic and Partial Reconfiguration (DPR) is a special feature offered by Xilinx Field Programmable Gate Arrays (FPGAs), giving the designer the ability to reconfigure a certain portion of the FPGA during run-time without influencing the other parts. This feature allows the hardware to be adaptable to any potential situation. For some applications, such as video-based driver assistance [1], the time needed to exchange a certain portion of the device might be critical. This paper addresses problems, limitations and results of on-chip reconfiguration that enable the user to decide whether DPR is suitable for a certain design prior to its implementation. A method is therefore introduced to calculate the expected reconfiguration throughput and latency. In addition, an IP core is presented that enables fast on-chip DPR close to the maximum achievable speed. Compared to an alternative state-of-the art realization, an increase in speed by a factor of 58 can be obtained.
Christopher Claus, Walter Stechele, Lars Braun, Michael Hübner 0001, Jürgen Becker 0001
FPL6
2008 Coarse-grained reconfiguration
abstract
In the last years, aside from fine-grained reconfigurable architectures such as FPGAs, coarse-grained reconfigurable architectures (CGRAs), which typically have building blocks of a fixed bit-width (8 bit, 16 bit, etc.), have gained in importance in academia as well as in industry. CGRAs are usually used for domain-specific computations and have advantages over traditional FPGAs in terms of area and power cost, performance, and reconfiguration time. Thus, architectures with coarse-grained reconfiguration features have also been studied in projects (Sec. 1, 2, 4) within the priority program Reconfigurable Computing Systems and the project CoMap (Sec. 3), which are all sponsored by the German science foundation.
Sven Eisenhardt, Thomas Schweizer, Julio de Oliveira Filho, Tobias Oppold, Wolfgang Rosenstiel, Alexander Thomas, Jürgen Becker 0001, Frank Hannig, Dmitrij Kissler, Hritam Dutta, Jürgen Teich, Heiko Hinkelmann, Peter Zipf, Manfred Glesner
FPL7
2008 New dimensions for multiprocessor architectures: Ondemand heterogeneity, infrastructure and performance through reconfigurability - the RAMPSoC approach
abstract
Multiprocessor hardware architectures enable to distribute tasks of an application to several microprocessors, in order to exploit parallelism for accelerating the performance of computation. Especially for the application domain of image data processing, where computation performance is a crucial factor to keep the real-time requirements, this approach is a promising solution for the assembly of high sophisticated algorithms e.g. for object tracking. Changing requirements and the necessary implementation of the tasks in terms of modified algorithms, precision and communication needs to be handled by software and hardware adaptation in state of the art architectures. Field programmable gate arrays (FPGAs) enable to exploit the adaptation of hardware cores and the software running on embedded microprocessor cores on an integrated multiprocessor system.
Diana Göhringer, Michael Hübner 0001, Thomas Perschke, Jürgen Becker 0001
FPL4
2008 Exploitation of dynamic and partial hardware reconfiguration for on-line power/performance optimization
abstract
This paper presents the results from research work done in the field of reconfigurable architectures and systems. Dynamic and partial reconfiguration has mainly been investigated as a way to configure functionalities in hardware on-demand, controlled either by the user or by the system itself. This paper presents work that was aimed at applying hardware reconfiguration even for run-time adaptation of functional implementation in order to enable self-optimization of power and performance according to the run-time specific requirements of the application.
Katarina Paulsson, Michael Hübner 0001, Jürgen Becker 0001
FPL3
2008 Reducing latency times by accelerated routing mechanisms for an FPGA gateway in the automotive domain
abstract
In todays and future automotive electric/electronic architectures the central gateway is one of the key components. The introduction of high performance bus systems like FlexRay and Ethernet, as well as new applications, creates additional requirements for gateway systems. The usage of reconfigurable hardware gives an interesting alternative to existing microcontroller based solutions. A modular gateway prototype based on a field programmable gate array (FPGA) with specialized routing modules allows a significant speed up compared to microcontroller solutions. The architecture of the routing hardware modules as well as the most relevant implementation details are described in this paper. The complete routing functionality was implemented and tested under series constraints. A performance comparison shows significant speedups. Our toolflow for routing table generation is presented in addition. A final version of the gateway has been successfully integrated into a modern mid class vehicle.
Oliver Sander, Michael Hübner 0001, Jürgen Becker 0001, Matthias Traub
FPT3
2008 A self adaptive interfacing concept for consumer device integration into automotive entities
abstract
Innovation in today's automobiles is mainly driven by electronic development. Standard infotainment devices delivered by car manufacturers offer services such as navigation, television, DVD, telephony and more. Especially in the last few years a trend can be recognized extending from these OEM specific solutions towards integration of consumer electronic devices such as iPods, cell phones or the like. An approach solely based on software adjustments might not be sufficient to solve the problem of car to mobile device communication. Reconfigurable hardware offers a unique possibility of adapting to a given problem in hardware as well as software structures. The feature of partial dynamic reconfiguration in particular can contribute significantly to the flexibility of the overall system. Any adaptation of the running system should be automatic and going unnoticed by the user. This contribution depicts an approach that utilizes reconfigurable hardware for connecting consumer electronics to an automobile. Detection of protocols, loading of appropriate hardware interfaces, as well as integration of offered or requested services are the essential steps presented in this paper.
Benjamin Glas, Alexander Klimm, Oliver Sander, Klaus D. Müller-Glaser, Jürgen Becker 0001
IPDPS5
2008 Runtime adaptive multi-processor system-on-chip: RAMPSoC
abstract
Current trends in high performance computing show, that the usage of multiprocessor systems on chip are one approach for the requirements of computing intensive applications. The multiprocessor system on chip (MPSoC) approaches often provide a static and homogeneous infrastructure of networked microprocessor on the chip die. A novel idea in this research area is to introduce the dynamic adaptivity of reconfigurable hardware in order to provide a flexible heterogeneous set of processing elements during run-time. This extension of the MPSoC idea by introducing run-time reconfiguration delivers a new degree of freedom for system design as well as for the optimized distribution of computing tasks to the adapted processing cells on the architecture related to the changing application requirements. The "computing in time and space"paradigm and the extension with the new degree of freedom for MPSoCs will be presented with the RAMPSoC approach described in this paper.
Diana Göhringer, Michael Hübner 0001, Volker Schatz, Jürgen Becker 0001
IPDPS4
2008 Run-time reconfigurable adaptive multilayer network-on-chip for FPGA-based systems
abstract
Since the 1990s reusable functional blocks, well known as IP-Cores, were integrated on one silicon die. These systems-on-chip (SoC) used a bus-based system for intermodule communication. Technology and flexibility issues forced to introduce a novel communication system called network-on-chip (NoC). Around 1999 this method was introduced and until then it is investigated by several research groups with the aim to connect different IP-Blocks through an effective, flexible and scalable communication network. Exploiting the flexibility of FPGAs, the run-time adaptivity through run-time reconfiguration, opens a new area of research by considering dynamic and partial reconfiguration. This paper presents an approach for exploiting dynamic and partial reconfiguration with Xilinx Virtex-II FPGAs for a multi-layer network-on-chip and the related techniques for adapting the network while run-time to the requirements of an application.
Michael Hübner 0001, Lars Braun, Diana Göhringer, Jürgen Becker 0001
IPDPS4
2008 An adaptive and scalable multiprocessor system For Xilinx FPGAs using minimal sized processor cores
abstract
In embedded systems, especially in multi-purpose platforms, the need for computational power can vary greatly. This depends mainly on the type of applications running on the platform as well as on limitations such as real-time constraints or the amount of data being processed. These factors can change during lifetime of the system and even during runtime. A highly adaptive computing platform is desirable, providing exactly the computational power and speed needed for any particular task at any particular time using minimal resources. This contribution discusses a highly scalable multiprocessor system composed of minimal sized processor cores. The proposed architecture is intended for computational intensive applications such as on-line routing and placement on FPGAs or applications in the cryptographic domain. While offering a lot of leeway in computational power it uses minimal resources on an FPGA, thus freeing hardware resources for applications running in parallel to the multiprocessor system.
Alexander Klimm, Lars Braun, Jürgen Becker 0001
IPDPS3
2008 A framework for dynamic 2D placement on FPGAs
abstract
The presented paper describes an approach of dynamic positioning of functional building blocks on Virtex (Xilinx) FPGAs. The modules can be of a variable rectangular shape. Further, the on-chip location of the area to be reconfigured can be freely chosen, so that any module can be placed anywhere within the defined dynamic region of the FPGA. Thus the utilization of the chip area can be optimized, which in turn reduces e.g. costly area and power consumption. This paper describes a runtime system and the necessary framework, which is able to manage the reconfigurable area. Further it shows how a NoC approach can be applied to shorten wire lengths for communication. This will in turn save routing resources and potentially increases clock speed.
Christian Schuck, Matthias Kühnle, Michael Hübner 0001, Jürgen Becker 0001
IPDPS4
2007 Circuit Switched Run-Time Adaptive Network-on-Chip for Image Processing Applications
abstract
Since the 1990s reusable functional blocks, well known as IP-Cores, have been integrated on one silicon die. These Systems-on-Chip (SoC) used a bus-based system for intermodule communication. Technology, performance and flexibility issues require the introduction of a novel communication system called Network-on-Chip (NoC). Around 1999 this method was introduced and since then has been investigated by several research groups with the aim to connect different IP-Cores through an effective, flexible and scalable communication network. Exploiting the flexibility of FPGAs, the run-time adaptivity through run-time reconfiguration, opens a new area of research by considering dynamic and partial reconfiguration. Since software parts of an electronic system can also be included into reconfigurable hardware by integration of IP-based microcontrollers, the reconfigurable architecture provides a flexible, multi-adaptive heterogeneous platform for HW / SW Co-designs. This paper presents an approach for exploiting dynamic and partial reconfiguration with Xilinx Virtex-II FPGAs for an adaptive circuit switched Network-on-chip and the related techniques for adapting the system during run-time to the requirements of the presented image processing application.
Lars Braun, Michael Hübner 0001, Jürgen Becker 0001, Thomas Perschke, Volker Schatz, Stefan Bach
FPL3
2007 H.264 Decoder at HD Resolution on a Coarse Grain Dynamically Reconfigurable Architecture
abstract
The eXtreme Processing Platform (XPP) is a new runtime-reconfigurable data processing architecture. It is based on a scalable array of coarse grained computing elements and a packet oriented communication network. The strength of XPP originates from the combination of array processing with unique, powerful runtime-reconfiguration mechanisms. Parts of the array can be configured rapidly in parallel while neighboring computing elements are processing data. Reconfiguration is triggered by internal event signals, or by a Function Processing Array Element (FNC-PAE). The XPP-III architecture is designed to support pipelining and parallelism: instruction-level, data-flow and task-level parallelism. The control flow is handled by multiple VLIW like processors which are closely coupled to the reconfigurable array. Therefore this technology is very well suited for multimedia, telecommunications, graphics and similar stream-based applications with data and control flow. This paper presents the performance of H.264/AVC decoder on XPP-III. The simulation results are very encouraging and allow up to HD (1920x1080@ 24fps) decoding on the XPP-III architecture.
Mahendra Kumar Angamuthu Ganesan, Sundeep Singh, Frank May, Jürgen Becker 0001
FPL4
2007 A Graphical Model-Level Debugger for Heterogenous Reconfigurable Architectures
abstract
Graphical modeling languages allow to specify structure and behavior of mixed hardware-and software-systems on high abstraction level and can be automatically rendered into deployable implementations. In this paper we extend a model-based development process by means to debug functionality specified using Matlab Stateflow models in its hardware- and software-implementation on the target system. The user can control and view the system state graphically from the model's level. We introduce an Eclipse based software-tool based on our approach and apply it to a dynamically reconfigurable slot-based FPGA runtime environment.
Philipp Graf, Michael Hübner 0001, Klaus D. Müller-Glaser, Jürgen Becker 0001
FPL4
2007 Implementation of a Virtual Internal Configuration Access Port (JCAP) for Enabling Partial Self-Reconfiguration on Xilinx Spartan III FPGAs
abstract
The exploitation of dynamic and partial hardware reconfiguration on FPGAs is currently being investigated in various research projects, dealing with systems for space applications to automotive and masurement applications. Despite challanges such as a complicated design flow, dynamic reconfigurable systems offer advantages in terms of flexibility and performance. Unfortunately only few kinds of commercial architectures support dynamic and partial reconfiuration, which has lead to Virtex II / IV being main target architectures for this kind of systems. Additionally, the Xilinx Spartan III architecture is dynamically and partially reconfigurable with some limitations, one of them being the lack of an internal configuration port. The Virtex II / IV and V architectures all include the ICAP port, which allows a system to reconfigure itself during run-time without additional external components. Until now, this was not possible on the Spartan III architecture. This paper presents the implementation of a virtual internal configuration port for the Spartan III family of FPGAs. The configuration port was implemented for a hardware reconfigurable measurement system, which is implemented on a Spartan III FPGA due to its cost- and power optimized characteristics.
Katarina Paulsson, Michael Hübner 0001, Günther Auer, Michael Dreschmann, Jürgen Becker 0001
FPL5
2007 On-line Routing of Reconfigurable Functions for Future Self-Adaptive Systems - Investigations within the ÆTHER Project
abstract
The progress in hardware technologies for implementing portable, low power and low cost electronic systems for consumer products has been major the last years. The complexity of embedded systems will further increase at a rate which is not met by the development of advanced CAD tools for managing the large design space. This will likely lead to increased design problems regarding system implementation, test and verification. In the next 15-20 years, it is likely that the consumer products are based on computing devices which are grouped together in networks including thousands or even millions of nodes. The ÆTHER project deals with managing the complexity of such systems based on emerging technologies for future applications. This paper presents how the design complexity can be managed at the hardware level by integrating self-adaptive characteristics, and how the trade-off in performance and flexibility can be optimized to fulfill all application requirements while reducing the design complexity.
Katarina Paulsson, Michael Hübner 0001, Jürgen Becker 0001, Jean-Marc Philippe, Christian Gamrat
FPL3
2007 artNoC - A Novel Multi-Functional Router Architecture for Organic Computing
abstract
As CMOS technology scales down into the deep-submicron deep-submicron (DSM) domain, systems on chip (SoC) and especially the interconnect networks (NoC) have become a focus of many research groups in the last years. The complexity, reliability and power consumption of SoCs with hundreds of IP-cores on a single chip is a great challenge for future research. Self organisation and online adaptivity are the key features to cope with the challenges. Therefore, we proposed a new organic computing platform: DodOrg. Organic processing cells (OPCs) form the underlying hardware architecture similar to the cells found in the human body. In this paper we present a new on-chip interconnection network called artNoC that connects the OPCs on chip. artNoC is a lightweight NoC approach that supports besides best effort traffic, real time traffic as well as broad and multicast traffic to efficiently support the self-x features of the DodOrg platform.
Christian Schuck, Stefan Lamparth, Jürgen Becker 0001
FPL3
2007 MORPHEUS: Heterogeneous Reconfigurable Computing
abstract
Reconfigurable architectures and NoC (Network-on-Chip) communication systems have introduced new research directions for technology and flexibility issues, which have been largely investigated in the last decades. Exploiting the flexibility of reconfigurable architectures, the run-time adaptivity through run-time reconfiguration, opens a new area of research by considering dynamic reconfiguration. Since software parts of an embedded system can also be included into reconfigurable hardware by integration of an IP-based microcontroller, the reconfigurable architecture provides a flexible, multi-adaptive heterogeneous platformfor HW/SW co-design. In this paper, we present the European Integrated Project MORPHEUS (IST 027342). Its goal is to develop new heterogeneous reconfigurable SoCs with various sizes of reconfiguration granularity and to provide an integrated toolset of spatial and sequential design that can be used for mapping and execution of the target applications. Additionally a NoC approach is included in order to demonstrate the mentioned benefits and scalability for actual and future SoC design. The power of this approach will be demonstrated with four applications from the industrial environment.
Florian Thoma, Matthias Kühnle, Philippe Bonnot 0001, Elena Moscu Panainte, Koen Bertels, Sebastian Goller, Axel Schneider, Stéphane Guyetant, Eberhard Schüler, Klaus D. Müller-Glaser, Jürgen Becker 0001
FPL11
2007 High-Level Synthesis of HW Tasks Targeting Run-Time Reconfigurable FPGAs
abstract
This paper presents a novel high-level synthesis (HLS) and optimization approach targeting FPGA architectures that are reconfigurable at run-time. To model a reconfigurable system on a high level of abstraction, we use a hierarchical operation (control and data) flow graph. In order to reduce the overhead for reconfiguring the system, we apply resource sharing to our model to deduce reusable design parts for the implementation. A case study compares our HLS approach with a reference design which was manually coded on register-transfer-level (RTL).
Maik Boden, Thomas Fiebig, Torsten Meibner, Steffen Rülke, Jürgen Becker 0001
IPDPS5
2007 A General Purpose Partially Reconfigurable Processor Simulator (PReProS)
abstract
An innovative technique to model and simulate partial and dynamic reconfigurable processors is presented in this paper. The basis for development is a SystemC kernel modified for dynamic reconfiguration. The presented approach can either be used at transaction-level, which allows the modeling and simulation of higher-level hardware and embedded software, or at register transfer level (RTL), if the dynamic system behavior is desired to be observed at signal level. The reconfigurable processor can be easily set to model the desired architecture in a behavioral but reasonable way. An example is presented where a XPP processor is implemented and simulated, executing typical applications. The resulting statistics assist either in the choice of the best cost/benefit configuration area that should be available on chip, or in the choice of the target architecture itself.
Alisson Vasconcelos de Brito, Matthias Kühnle, Elmar U. K. Melcher, Jürgen Becker 0001
IPDPS4
2007 Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
abstract
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarse-grained processing elements (PEs). The method uses a three-address code SSA (static single assignment) representation of the kernel being mapped and rewriting logic for template matching and algebraic optimizations. This approach is able to identify sets of SSA instructions that can be mapped to different PE complexities available in coarse-grained reconfigurable computing architectures. As a proof of concept, results of the approach with a number of benchmark kernels, as far as coverage of template instructions is concerned, are included.
Carlos Morra, João M. P. Cardoso, Jürgen Becker 0001
IPDPS3
2007 Communication Architectures for Dynamically Reconfigurable FPGA Designs
abstract
This paper gives a survey of communication architectures which allow for dynamically exchangeable hardware modules. Four different architectures are compared in terms of reconfiguration capabilities, performance, flexibility and hardware requirements. A set of parameters for the classification of the different communication architectures is presented and the pro and cons of each architecture are elaborated. The analysis takes a minimal communication system for connecting four hardware modules as a common basis for the comparison of the diverse data given in the papers on the different architectures.
Thilo Pionteck, Carsten Albrecht, Roman Koch, Erik Maehle, Michael Hübner 0001, Jürgen Becker 0001
IPDPS6
2007 QUKU: A FPGA Based Flexible Coarse Grain Architecture Design Paradigm using Process Networks
abstract
DSP applications can be suitably represented using process network models. This paper uses a modification of Kahn process network to solve the problem of finding an optimum architectural template for coarse grain array on per application basis. By applying the model at architectural level in QUKU, better hardware efficiency is achieved for a wide domain of applications. A few widely used DSP algorithms have been presented to demonstrate the application of process network models into architectural template generation in QUKU.
Sunil Shukla, Neil W. Bergmann, Jürgen Becker 0001
IPDPS3
2007 New tool support and architectures in adaptive reconfigurable computing
abstract
Novel methods and reconfigurable architectures provide an increased design space by exploiting the dynamic and partial reconfiguration of hardware. The multi-adaptivity of this heterogeneous reconfigurable architectures reaches from adaptation to performance requirements over adaptation to power consumption in relation to an available amount of energy to adaptation to not predictable requirements from the user. Especially the unpredictable demands and requirements to a computing architecture require a high and filigree adaptivity in order to find an optimized point of operation while run- time. Additional to this issue the increased availability of electronic systems comes by introduction of novel methods for failure redundancy which can be seen as an application of this multi-adaptive system. In this contribution the ideas for a novel system approach will be presented in three parts. First the hardware and methods providing the multi-adaptivity will be presented. This is the basis for higher level design tools and opens a variety of parameters for adaptivity. The mechanisms of reconfigurability will be introduced in detail from basic knowledge to advanced mechanisms and methods. In addition the abstraction levels for manipulation the reconfigurable architecture and points to the tool support for novel reconfigurable FPGA architectures from Xilinx are sketched.
Jürgen Becker 0001, Adam Donlin, Michael Hübner 0001
VLSI-SoC1
2007 Dynamic and Partial FPGA Exploitation
abstract
Today's field programmable gate array (FPGA) architectures, like Xilinx's Virtex-II series, enable partial and dynamic run-time self-reconfiguration. This feature allows the substitution of parts of a hardware design implemented on this reconfigurable hardware, and therefore, a system can be adapted to the actual demands of applications running on the chip. Exploiting this possibility enables the development of adaptive hardware for a huge variety of applications. A novel method for communication interfaces using look up table (LUT)-based communication primitives enables an exact separation of reconfigurable parts and a fast and intelligent bus-system. A new adaptive software/hardware reconfigurable system is presented in this paper, using a real application in the automotive domain implemented on a Xilinx Virtex-II 3000 FPGA to present results.
Jürgen Becker 0001, Michael Hübner 0001, Gerhard Hettich, Rainer Constapel, Joachim Eisenmann, Jürgen Luka
Proc. IEEE1
2006 From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
abstract
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations and the quick generation of functionally equivalent alternative implementations. The simple but powerful semantics of rewriting logic provide a natural mechanism for manipulating algebraic expressions, using a high-level of abstraction which is afterwards automatically converted into lower levels of abstraction. The design flow is validated by generating polynomial approximations for arbitrary continuous functions. The polynomial generation process is completely parameterized regarding polynomial degree, number representation parameters, word width and polynomial evaluation approaches. Different functionally equivalent implementations for the resulting polynomial approximations were generated and synthesized for a Virtex4 device
Carlos Morra, M. Sackmann, Sunil Shukla, Jürgen Becker 0001, Reiner W. Hartenstein
FPL4
2006 A high-level target-precise model for designing reconfigurable HW tasks
abstract
The increasing complexity of embedded digital HW/SW systems, rising chip development and fabrication costs, and a shortened time-to-market require system-level design methods and the use of reconfigurable architectures. Our design method concerns the modelling of a system and its HW tasks at a high abstraction level. Using design patterns and macros, our library-based approach provides a consistent flow from an executable specification to its implementation. These templates ease the efficient application of partially run-time reconfigurable architectures. A case study depicts the high-level modelling of a HW task and its implementation in detail.
Maik Boden, Steffen Rülke, Jürgen Becker 0001
IPDPS3
2006 Elementary block based 2-dimensional dynamic and partial reconfiguration for Virtex-II FPGAs
abstract
The development of field programmable gate arrays (FPGAs) had tremendous improvements in the last few years. They were extended from simple logic circuits to complex systems-on-chip which enable the integration of complete microcontroller systems and their peripheral devices. Virtex-II FPGAs from Xilinx provide the possibility of dynamic and partial reconfiguration. This can be taken advantage of to substitute inactive parts of a hardware system and adapt the complete chip to a different requirement of an application while run-time. Existing approaches allow reconfiguration of slot based systems while run-time. Unfortunately such systems suffer from the fact, that fixed sized reconfigurable slots are not completely utilized by all functional blocks. Therefore a new 2-dimensional approach is necessary to optimize the placement of functions on the reconfiguration area for the FPGA. Benefit is a reduced chip size which leads to a reduction of power dissipation. This paper describes the method and procedure to include a 2-dimensional placement of reconfigurable blocks and the integration to a run-time system.
Michael Hübner 0001, Christian Schuck, Jürgen Becker 0001
IPDPS3
2006 Communication concept for adaptive intelligent run-time systems supporting distributed reconfigurable embedded systems
abstract
Reconfigurable computing systems have already shown their abilities to accelerate embedded hardware/software systems. Since standard processor-based embedded applications have come to their limits we need new concepts for controlling and managing embedded, possibly distributed, reconfigurable hardware/software computing systems. Succeeding to previous papers which dealt with management aspects of run-time reconfigurable systems and related AI-approaches this contribution describes an approach and proof of concept of a transparent communication mechanism between the application layer and its possibly distributed and reconfigurable hardware/software sub-function modules.
Michael Ullmann, Jürgen Becker 0001
IPDPS2
2005 Run-Time Scheduling for Random Multi-Tasking in Reconfigurable Coprocessors
abstract
The authors addressed the multi-tasking issue for reconfigurable coprocessors in random application contexts. A scheduling algorithm was proposed to handle simultaneously a set of random tasks and able to maximize the resource usage even when the task-load is low. For this, processes are considered as relocatable: a simple transformation scheme is applied by a configuration controller to the initial configuration in order to relocate or duplicate the task when necessary. In this paper, the proposed method is implemented on a coarse grain reconfigurable architecture with 8 and 32 processing elements. A large amount of random scenario have been simulated and the statistical results presented here clearly show real advantages of the proposed method, but also some limitations drawing the line of future works.
Pascal Benoit, Jürgen Becker 0001, Michel Robert, Lionel Torres, Gilles Sassatelli, Gaston Cambon
FPL2
2005 FELIX: Using Rewriting-Logic for Generating Functionally Equivalent Implementations
abstract
FELIX is a new design space exploration tool and graphical integrated development environment (IDE) for the programming of coarse-grained reconfigurable architectures. Its main and novel advantage is the use of rewriting rules and logical strategies for the automated generation of alternative functionally equivalent implementations from a single mathematical specification. The user selection of the rewriting logic strategies to be applied determines the resulting implementations, making it possible to quickly generate, simulate and evaluate alternative implementations that are logically equivalent. The FELIX system includes an interface to the KressArray Xplorer for hardware design-space exploration. The current version of the tool is targeted for the pact extreme processing platform (XPP), with support for additional architectures planned in future versions.
Carlos Morra, Jürgen Becker 0001, Mauricio Ayala-Rincón, Reiner W. Hartenstein
FPL2
2004 Hardware Support for QoS-based Function Allocation in Reconfigurable Systems
abstract
This paper presents a new approach for allocating suitable function-implementation variants depending on given quality-of-service function requirements for run-time reconfigurable multi-device systems. Our approach adapts methodologies from the domain of knowledge-based systems which can be used for doing run-time hardware/software resource usage optimizations.
Michael Ullmann, Wansheng Jin, Jürgen Becker 0001
DATE3
2004 Scalable Application-Dependent Network on Chip Adaptivity for Dynamical Reconfigurable Real-Time Systems
Michael Hübner 0001, Michael Ullmann, Lars Braun, A. Klausmann, Jürgen Becker 0001
FPL5
2004 Dynamic Adaptive Runtime Routing Techniques in Multigrain Reconfigurable Hardware Architectures
Alexander Thomas, Jürgen Becker 0001
FPL2
2004 On-Demand FPGA Run-Time System for Dynamical Reconfiguration with Adaptive Priorities
Michael Ullmann, Michael Hübner 0001, Björn Grimm, Jürgen Becker 0001
FPL4
2004 CARUSO - An Approach Towards a Network of Low Power Autonomic Systems on Chips for Embedded Real-time Application
abstract
Summary form only given. We propose CARUSO - a new SoC approach that emphasizes connectivity, autonomic computing principles, real-time, and ultra-low power requirements. The requirements shall be fulfilled by a multithreaded processor core within a reconfigurable SoC. A helper thread running with low priority in an own thread slot concurrent to the application implements an autonomic manager that monitors the application. A middleware decides if self-optimization, self-configuration, self-protection, or self-healing techniques must be triggered based on the autonomic manager's information and further application knowledge.
Uwe Brinkschulte, Jürgen Becker 0001, Theo Ungerer
IPDPS2
2004 An FPGA Run-Time System for Dynamical On-Demand Reconfiguration
abstract
Summary form only given. The handling of an increasing number of automotive comfort functionalities has become a significant problem for the most automobile manufacturers since communication, power consumption, available space and cost become important issues for a growing number of engine control units. Our contribution presents a first approach for a flexible versatile FPGA-based run-time system supporting a resource saving function multiplex.
Michael Ullmann, Michael Hübner 0001, Björn Grimm, Jürgen Becker 0001
IPDPS4
2003 An Industrial/Academic Configurable System-on-Chip Project (CSoC): Coarse-Grain XXP-/Leon-Based Architecture Integration
Jürgen Becker 0001, Alexander Thomas, Martin Vorbach, Volker Baumgarten
DATE1
2003 Real-Time Dynamically Run-Time Reconfiguration for Power-/Cost-optimized Virtex FPGA Realizations
Jürgen Becker 0001, Michael Hübner 0001, Michael Ullmann
VLSI-SOC1
2003 Datapath and Compiler Integration of Coarse-grain Reconfigurable XPP-Arrays into Pipelined RISC Processors
Jürgen Becker 0001, Alexander Thomas, Maik Scheer
VLSI-SOC1
2003 Configware and morphware going mainstream
Jürgen Becker 0001, Reiner W. Hartenstein
J. Syst. Archit.1
2001 Efficient Mapping of Pre-synthesized IP-Cores onto Dynamically Reconfigurable Array Architectures
Jürgen Becker 0001, Nicolas Liebau, Thilo Pionteck, Manfred Glesner
FPL1
2001 A Parallel Dynamically Reconfigurable Architecture Designed for Flexible Application-Tailored Hardware/Software Systems in Future Mobile Communication
Jürgen Becker 0001, Manfred Glesner
J. Supercomput.1
2000 Architecture and Application of a Dynamically Reconfigurable Hardware Array for Future Mobile Communication Systems
abstract
The evolving of current and future broadband access techniques into the wireless domain introduces new and flexible network architectures with difficult and interesting challenges. The system designers are faced with a challenging set of problems that stem from access mechanisms, energy conservation, error rate, transmission speed characteristics of the wireless links and mobility aspects. This paper presents first the major challenges in realizing flexible microelectronic system solutions for future mobile communication applications. Based thereupon, the architecture design of flexible system-on-a-chip solutions in the digital baseband processing for future mobile radio devices is discussed. The focus of the paper is the introduction of a new parallel and dynamically reconfigurable hardware architecture tailored to this application area. Its performance issues and potential are discussed by the implementation of a flexible and computation-intensive component of future mobile terminals.
Ahmad Alsolaim, Janusz A. Starzyk, Jürgen Becker 0001, Manfred Glesner
FCCM3
1998 Parallelization in Co-Compilation for Configurable Accelerators
abstract
The paper introduces a novel co-compiler and its "vertical" parallelization method, including a general model for co-operating host/accelerator platforms and a new parallelizing compilation technique derived from it. Small examples are used for illustration. It explains the exploitation of different levels of parallelism to achieve optimized speed ups and hardware resource utilization. Section II introduces novel vertical parallelization techniques involving parallelism exploitation at four different levels (task, loop, statement, and operation level) is explained, achieved by for configurable accelerators. Finally the results are illustrated by a simple application example. But first the paper summarizes the fundamentally new dynamically reconfigurable hardware platform underlying the co-compilation method.
Jürgen Becker 0001, Reiner W. Hartenstein, Michael Herz, Ulrich Nageldinger
ASP-DAC1
1997 A Novel Sequencer Hardware for Application Specific Computing
abstract
This paper introduces a powerful novel sequencer for controlling computational machines and for structured DMA (direct memory access) applications. It is mainly focused on applications using 2-dimensional memory organization, where most inherent speed-up is obtained thereof. A classification scheme of computational sequencing patterns and storage schemes is derived. In the context of application specific computing the paper illustrates its usefulness especially for data sequencing-recalling examples hereafter published earlier, as far as needed for completeness. The paper also discusses, how the new sequencer hardware provides substantial speed-up compared to traditional sequencing hardware use.
Reiner W. Hartenstein, Jürgen Becker 0001, Michael Herz, Ulrich Nageldinger
ASAP2
1996 A Synthesis System For Bus-Based Wavefront Array Architectures
abstract
A datapath synthesis system (DPSS) for a bus-based wavefront array architecture, called rDPA (reconfigurable datapath architecture), is presented. An internal data bus to the array simplifies the access of the processing elements for data manipulations. The DPSS allows automatic mapping of high level datapath structures onto the rDPA without manual interaction. Optimization techniques are sketched. The rDPA is scalable to arbitrarily large arrays and reconfigurable to be adaptable to the computational problem. Fine grained parallelism is achieved by using simple reconfigurable processing elements which are called datapath units (DPUs). The rDPA can be used as a reconfigurable ALU in transport-triggered architectures as well as for rapid prototyping of high speed datapaths.
Reiner W. Hartenstein, Jürgen Becker 0001, Michael Herz, Rainer Kress 0002, Ulrich Nageldinger
ASAP2
1996 High-performance computing using a reconfigurable accelerator
abstract
The paper introduces the MoM-3 as a reconfigurable accelerator for high performance computing at a moderate price. By using a new machine paradigm to trigger the operations in the MoM-3, this accelerator is especially suited to scientific algorithms, where the hardware structure can be configured to match the structure of the algorithm. The MoM-3 efficiently uses reconfigurable logic devices to provide a fine-grain parallelism, and multiple address generators to have the complete memory bandwidth free for data transfers (instead of fetching address computing instructions). Speed-up factors up to 82, compared to state-of-the-art workstations, are demonstrated by means of an Ising spin system simulation example. Adding the MoM-3 as an accelerator enables achievement of supercomputer performance from a low-cost workstation.
Reiner W. Hartenstein, Jürgen Becker 0001, Rainer Kress 0002, Helmut Reinig
Concurr. Pract. Exp.2
1995 A Parallelizing Compilation Method for the Map-oriented Machine
abstract
The paper introduces a novel parallelizing compilation method for the MoM. The MoM (Map-oriented Machine) is an Xputer architecture featuring multiple data sequencers and "soft ALUs". The compiler accepts C-source, which are restructured and partitioned into structural and sequential code providing parallelism at expression and statement level.
Reiner W. Hartenstein, Jürgen Becker 0001, Rainer Kress 0002, Helmut Reinig, Karin Schmidt
ASAP2