Florian Porrmann

Mr. Florian Porrmann

Bielefeld University
+1
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2023
Verified
Conference Paper
Open access
KMKevin Mika
Kevin Mika
RGRené Griessl
René Griessl
NKNils Kucza
Nils Kucza
FPFlorian Porrmann
Florian Porrmann
MKMartin Kaiser
Martin Kaiser
FMFranz Meierhöfer
Franz Meierhöfer
The VEDLIoT project aims to develop energy-efficient Deep Learning methodologies for distributed Artificial Intelligence of Things (AIoT) applications. During our project, we propose a holistic approach that focuses on optimizing algorithms while addressing safety and security challenges inherent to AIoT systems. The foundation of this approach lies in a modular and scalable cognitive IoT hardware platform, which leverages microserver technology to enable users to configure the hardware to meet the requirements of a diverse array of applications. Heterogeneous computing is used to boost performance and energy efficiency. In addition, the full spectrum of hardware accelerators is integrated, providing specialized ASICs as well as FPGAs for reconfigurable computing. The project's contributions span across trusted computing, remote attestation, and secure execution environments, with the ultimate goal of facilitating the design and deployment of robust and efficient AIoT systems. The overall architecture is validated on use-cases ranging from Smart Home to Automotive and Industrial IoT appliances. Ten additional use cases are integrated via an open call, broadening the range of application areas.

21 February 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
SPSarah Pilz
Sarah Pilz
FPFlorian Porrmann
Florian Porrmann
MKMartin Kaiser
Martin Kaiser
JHJens Hagemeyer
Jens Hagemeyer
JHJames M. Hogan
James M. Hogan
URUlrich Rückert
Ulrich Rückert
This paper is concerned with Field Programmable Gate Arrays (FPGA)-based systems for energy-efficient high-throughput string comparison. Modern applications which involve comparisons across large data sets—such as large sequence sets in molecular biology—are by their nature computationally intensive. In this work, we present a scalable FPGA-based system architecture to accelerate the comparison of binary strings. The current architecture supports arbitrary lengths in the range 16 to 2048-bit, covering a wide range of possible applications. In our example application, we consider DNA sequences embedded in a binary vector space through Locality Sensitive Hashing (LSH) one of several possible encodings that enable us to avoid more costly character-based operations. Here the resulting encoding is a 512-bit binary signature with comparisons based on the Hamming distance. In this approach, most of the load arises from the calculation of the O ( m ∗ n ) Hamming distances between the signatures, where m is the number of queries and n is the number of signatures contained in the database. Signature generation only needs to be performed once, and we do not consider it further, focusing instead on accelerating the signature comparisons. The proposed FPGA-based architecture is optimized for high-throughput using hundreds of computing elements, arranged in a systolic array. These core computing elements can be adapted to support other string comparison algorithms with little effort, while the other infrastructure stays the same. On a Xilinx Virtex UltraScale+ FPGA (XCVU9P-2), a peak throughput of 75.4 billion comparisons per second—of 512-bit signatures—was achieved, using a design with 384 parallel processing elements and a clock frequency of 200 MHz. This makes our FPGA design 86 times faster than a highly optimized CPU implementation. Compared to a GPU design, executed on an NVIDIA GTX1060, it performs nearly five times faster.

16 September 2021 in Frontiers in Neuroinformatics
Verified
Journal Article
Open access
FPFlorian Porrmann
Florian Porrmann
SPSarah Pilz
Sarah Pilz
ASAlessandra Stella
Alessandra Stella
AKAlexander Kleinjohann
Alexander Kleinjohann
MDMichael Denker
Michael Denker
URUlrich Rückert
Ulrich Rückert
The SPADE (spatio-temporal Spike PAttern Detection and Evaluation) method was developed to find reoccurring spatio-temporal patterns in neuronal spike activity (parallel spike trains). However, depending on the number of spike trains and the length of recording, this method can exhibit long runtimes. Based on a realistic benchmark data set, we identified that the combination of pattern mining (using the FP-Growth algorithm) and the result filtering account for 85–90% of the method's total runtime. Therefore, in this paper, we propose a customized FP-Growth implementation tailored to the requirements of SPADE, which significantly accelerates pattern mining and result filtering. Our version allows for parallel and distributed execution, and due to the improvements made, an execution on heterogeneous and low-power embedded devices is now also possible. The implementation has been evaluated using a traditional workstation based on an Intel Broadwell Xeon E5-1650 v4 as a baseline. Furthermore, the heterogeneous microserver platform RECS|Box has been used for evaluating the implementation on two HiSilicon Hi1616 (Kunpeng 916), an Intel Coffee Lake-ER Xeon E-2276ME, an Intel Broadwell Xeon D-D1577, and three NVIDIA Tegra devices (Jetson AGX Xavier, Jetson Xavier NX, and Jetson TX2). Depending on the platform, our implementation is between 27 and 200 times faster than the original implementation. At the same time, the energy consumption was reduced by up to two orders of magnitude.

28 May 2025 in IEEE Access
Verified
Journal Article
Open access
NKNils Kucza
Nils Kucza
FPFlorian Porrmann
Florian Porrmann
CSChristian Stollenwerk
Christian Stollenwerk
JHJens Hagemeyer
Jens Hagemeyer
A natural user interaction interface is required to enhance living environments to be fully smart, which would imply features like user-specific, individual interaction as well as awareness of context, situation, and environment. One already introduced example of such an interaction interface using only web service-based speech recognition is voice assistants, such as Amazon Alexa. A widely used visual solution is a smart mirror, consisting of a semi-transparent mirror underlay with a display and a computing device. In most cases, it only shows information next to the mirror image and does not feature an interactive interaction with the user. Hence, it does not utilize the potential of locally processed artificial intelligence. This publication presents the enhancement of a smart mirror with locally processed artificial intelligence, ensuring low-latency interaction as well non-exposure of private data. For a pleasant user experience, the image-based recognition of objects, gestures, and faces in combination with voice commands via speech recognition is used. With these features, the user can be identified, interact with the system, and receive personalized information or assistance. Due to the modular software architecture using ROS2 nodes, different embedded hardware modules and accelerators can be utilized. Possible configurations for such hardware and accelerator systems as well as optimization to increase energy efficiency are described and evaluated. Low power consumption, and therefore high energy-efficiency, is necessary for the application as it is intended to be integrated into private homes. Optimizations using pruning are evaluated and show improvements in energy per processed frame, required calculations per frame (50% reduction) , and accuracy (increased for some classes by by 15 %). Currently the best solution regarding efficiency and optimized DNN models achieves 30 FPS for object, gesture, and face detection models simultaneously while consuming around 38Watts, resulting in 1.3 mJ per frame.

1 October 2024 in IEEE Access
Verified
Journal Article
Open access
FPFlorian Porrmann
Florian Porrmann
JHJens Hagemeyer
Jens Hagemeyer
MPMario Porrmann
Mario Porrmann
The Self-Organizing Map (SOM) algorithm is a clustering algorithm used in a wide variety of application domains. Over the last few decades, it has been accelerated using various hardware architectures, including FPGAs, CPUs, and GPUs. This publication presents an High-Level Synthesis -based implementation that utilizes multiple processing elements to realize a high-performance system architecture. An extensive design space exploration was conducted to evaluate the performance range of the architecture. For this, vector dimensions ranging from 8 up to 512 and map sizes from 16 × 16 to 512 × 512 were used. The evaluation was performed using two different AMD/Xilinx UltraScale+ FPGA systems, the VCU128 PCIe-based accelerator card and the ZCU106 stand-alone evaluation kit. From the achieved results, it can be seen that the performance scales nearly linearly for a given vector dimension when the map size is increased. In addition, the energy efficiency for both FPGAs was analyzed, revealing that while the ZCU106 is less powerful in terms of raw compute power, it requires up to 4× less power and, depending on the configuration, can be 2× more energy efficient compared to the VCU128. One of the main reasons for this is that it does not require a dedicated host system but utilizes its internal ARM cores. Finally, a comparison against state-of-the-art SOM implementations was conducted. The proposed design achieves a speed-up of up to 458.7, 1,630.4, and 4.9 compared to other CPU, GPU, and FPGA realizations, respectively.