Dionysios Diamantopoulos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Dionysios Diamantopoulos has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Christoph Hagleitner
IBM Research Europe, Rschlikon, Switzerland
4 shared publications - Kostas Siozios
Aristotle University of Thessaloniki
3 shared publications - Burkhard Ringlein
IBM Research Europe, Rschlikon, Switzerland
2 shared publications - Dimitrios Soudris
National Technical University of Athens
2 shared publications - Gagandeep Singh
ETH Zurich
2 shared publications - Henk Corporaal
Eindhoven University of Technology, Eindhoven, The Netherlands
2 shared publications
Latest Publications
- Open Access
- 16 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 118-131
WannaLaugh: A Configurable Ransomware Emulator - Learning to Mimic Malicious Storage Traces
Ransomware, a fearsome and an evolving cybersecurity threat, continues to inflict severe consequences on individuals and organizations worldwide. Traditional detection methods, reliant on static signatures and application behavioral patterns, are challenged by the dynamic nature of these threats. This paper introduces two primary contributions to address this challenge. First, we introduce the WannaLaugh ransomware emulator. This tool is designed to safely mimic ransomware attacks without causing actual harm or spreading malware, making it a unique solution for studying ransomware behavior. Second, we show how this emulator can be used to mimic the I/O behavior of existing ransomware. Experimental results show that WannaLaugh can mimic six real ransomware with high accuracy. Both the emulator and its mimicking application aim to represent significant steps forward in ransomware detection in the era of machine-learning-driven cybersecurity.
- 16 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 118-131
Open AccessWannaLaugh: A Configurable Ransomware Emulator - Learning to Mimic Malicious Storage Traces
Ransomware, a fearsome and an evolving cybersecurity threat, continues to inflict severe consequences on individuals and organizations worldwide. Traditional detection methods, reliant on static signatures and application behavioral patterns, are challenged by the dynamic nature of these threats. This paper introduces two primary contributions to address this challenge. First, we introduce the WannaLaugh ransomware emulator. This tool is designed to safely mimic ransomware attacks without causing actual harm or spreading malware, making it a unique solution for studying ransomware behavior. Second, we show how this emulator can be used to mimic the I/O behavior of existing ransomware. Experimental results show that WannaLaugh can mimic six real ransomware with high accuracy. Both the emulator and its mimicking application aim to represent significant steps forward in ransomware detection in the era of machine-learning-driven cybersecurity.
- 5 July 2023
- Published by Elsevier in Future Generation Computer Systems
- Vol. 149, 39-58
WFA-FPGA: An efficient accelerator of the wavefront algorithm for short and long read genomics alignment
- 5 July 2023
- Published by Elsevier in Future Generation Computer Systems
- Vol. 149, 39-58
WFA-FPGA: An efficient accelerator of the wavefront algorithm for short and long read genomics alignment
- 13 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 22 (1) , 9-12
Advancing Compilation of DNNs for FPGAs Using Operation Set Architectures
The slow-down of technology scaling combined with the exponential growth of modern machine learning and artificial intelligence models has created a demand for specialized accelerators, such as GPUs, ASICs, and field-programmable gate arrays (FPGAs). FPGAs can be reconfigured and have the potential to outperform other accelerators, while also being more energy-efficient, but are cumbersome to use with today's fractured landscape of tool flows. We propose the concept of an operation set architecture to overcome the current incompatibilities and hurdles in using DNN-to-FPGA compilers by combining existing specialized frameworks into one organic compiler that also allows the efficient and automatic re-use of existing community tools. Furthermore, we demonstrate that mixing different existing frameworks can increase the efficiency by more than an order of magnitude.
- 13 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 22 (1) , 9-12
Advancing Compilation of DNNs for FPGAs Using Operation Set Architectures
The slow-down of technology scaling combined with the exponential growth of modern machine learning and artificial intelligence models has created a demand for specialized accelerators, such as GPUs, ASICs, and field-programmable gate arrays (FPGAs). FPGAs can be reconfigured and have the potential to outperform other accelerators, while also being more energy-efficient, but are cumbersome to use with today's fractured landscape of tool flows. We propose the concept of an operation set architecture to overcome the current incompatibilities and hurdles in using DNN-to-FPGA compilers by combining existing specialized frameworks into one organic compiler that also allows the efficient and automatic re-use of existing community tools. Furthermore, we demonstrate that mixing different existing frameworks can increase the efficiency by more than an order of magnitude.
- 12 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 21 (2) , 41-44
Dynamic Optimization of On-Chip Memories for HLS Targeting Many-Accelerator Platforms
Many-accelerator platforms have been introduced for maximizing FPGA's throughput. However, as the high saturation rate of the FPGA's on-chip memories limits the number of synthesized accelerators, frameworks for Dynamic Memory Management (DMM) that allow the synthesized designs to allocate/de-allocate on-chip memory resources during run-time have been suggested. Although, those frameworks manage to increase the accelerators’ density by minimizing the utilized memory resources, the parallel execution of many-accelerators may cause severe memory fragmentation and thus memory allocation failures. In this work, a framework that optimizes the memory usage by performing memory defragmentation operations in HLS many-accelerator architectures that share on-chip memories is proposed. Experimental results highlight the effectiveness of the proposed solution to eliminate memory allocation failures due to memory fragmentation, reduce memory allocation failures up to 32% on average and decrease the memory size requirements up to 5% with controllable latency and resource utilization overhead.
- 12 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 21 (2) , 41-44
Dynamic Optimization of On-Chip Memories for HLS Targeting Many-Accelerator Platforms
Many-accelerator platforms have been introduced for maximizing FPGA's throughput. However, as the high saturation rate of the FPGA's on-chip memories limits the number of synthesized accelerators, frameworks for Dynamic Memory Management (DMM) that allow the synthesized designs to allocate/de-allocate on-chip memory resources during run-time have been suggested. Although, those frameworks manage to increase the accelerators’ density by minimizing the utilized memory resources, the parallel execution of many-accelerators may cause severe memory fragmentation and thus memory allocation failures. In this work, a framework that optimizes the memory usage by performing memory defragmentation operations in HLS many-accelerator architectures that share on-chip memories is proposed. Experimental results highlight the effectiveness of the proposed solution to eliminate memory allocation failures due to memory fragmentation, reduce memory allocation failures up to 32% on average and decrease the memory size requirements up to 5% with controllable latency and resource utilization overhead.
- Open Access
- 6 June 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 15 (4) , 1-27
Accelerating Weather Prediction Using Near-Memory Reconfigurable Fabric
Ongoing climate change calls for fast and accurate weather and climate modeling. However, when solving large-scale weather prediction simulations, state-of-the-art CPU and GPU implementations suffer from limited performance and high energy consumption. These implementations are dominated by complex irregular memory access patterns and low arithmetic intensity that pose fundamental challenges to acceleration. To overcome these challenges, we propose and evaluate the use of near-memory acceleration using a reconfigurable fabric with high-bandwidth memory (HBM). We focus on compound stencils that are fundamental kernels in weather prediction models. By using high-level synthesis techniques, we develop NERO, an field-programmable gate array+HBM-based accelerator connected through Open Coherent Accelerator Processor Interface to an IBM POWER9 host system. Our experimental results show that NERO outperforms a 16-core POWER9 system by \( 5.3\times \) and \( 12.7\times \) when running two different compound stencil kernels. NERO reduces the energy consumption by \( 12\times \) and \( 35\times \) for the same two kernels over the POWER9 system with an energy efficiency of 1.61 GFLOPS/W and 21.01 GFLOPS/W. We conclude that employing near-memory acceleration solutions for weather prediction modeling is promising as a means to achieve both high performance and high energy efficiency.- 6 June 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 15 (4) , 1-27
Open AccessAccelerating Weather Prediction Using Near-Memory Reconfigurable Fabric
Ongoing climate change calls for fast and accurate weather and climate modeling. However, when solving large-scale weather prediction simulations, state-of-the-art CPU and GPU implementations suffer from limited performance and high energy consumption. These implementations are dominated by complex irregular memory access patterns and low arithmetic intensity that pose fundamental challenges to acceleration. To overcome these challenges, we propose and evaluate the use of near-memory acceleration using a reconfigurable fabric with high-bandwidth memory (HBM). We focus on compound stencils that are fundamental kernels in weather prediction models. By using high-level synthesis techniques, we develop NERO, an field-programmable gate array+HBM-based accelerator connected through Open Coherent Accelerator Processor Interface to an IBM POWER9 host system. Our experimental results show that NERO outperforms a 16-core POWER9 system by \( 5.3\times \) and \( 12.7\times \) when running two different compound stencil kernels. NERO reduces the energy consumption by \( 12\times \) and \( 35\times \) for the same two kernels over the POWER9 system with an energy efficiency of 1.61 GFLOPS/W and 21.01 GFLOPS/W. We conclude that employing near-memory acceleration solutions for weather prediction modeling is promising as a means to achieve both high performance and high energy efficiency. - Top Cited Papers
- 10 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 41 (4) , 39-48
FPGA-Based Near-Memory Acceleration of Modern Data-Intensive Applications
Modern data-intensive applications demand high computational capabilities with strict power constraints. Unfortunately, such applications suffer from a significant waste of both execution cycles and energy in current computing systems due to the costly data movement between the computation units and the memory units. Genome analysis and weather prediction are two examples of such applications. Recent field-programmable gate arrays (FPGAs) couple a reconfigurable fabric with high-bandwidth memory (HBM) to enable more efficient data movement and improve overall performance and energy efficiency. This trend is an example of a paradigm shift to near-memory computing. We leverage such an FPGA with HBM for improving the prealignment filtering step of genome analysis and representative kernels from a weather prediction model. Our evaluation demonstrates large speedups and energy savings over a high-end IBM POWER9 system and a conventional FPGA board with DDR4 memory. We conclude that FPGA-based near-memory computing has the potential to alleviate the data movement bottleneck for modern data-intensive applications.
- 10 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 41 (4) , 39-48
Top Cited PapersFPGA-Based Near-Memory Acceleration of Modern Data-Intensive Applications
Modern data-intensive applications demand high computational capabilities with strict power constraints. Unfortunately, such applications suffer from a significant waste of both execution cycles and energy in current computing systems due to the costly data movement between the computation units and the memory units. Genome analysis and weather prediction are two examples of such applications. Recent field-programmable gate arrays (FPGAs) couple a reconfigurable fabric with high-bandwidth memory (HBM) to enable more efficient data movement and improve overall performance and energy efficiency. This trend is an example of a paradigm shift to near-memory computing. We leverage such an FPGA with HBM for improving the prealignment filtering step of genome analysis and representative kernels from a weather prediction model. Our evaluation demonstrates large speedups and energy savings over a high-end IBM POWER9 system and a conventional FPGA board with DDR4 memory. We conclude that FPGA-based near-memory computing has the potential to alleviate the data movement bottleneck for modern data-intensive applications.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 98-106
PHRYCTORIA: A Messaging System for Transprecision OpenCAPI-attached FPGA Accelerators
Messaging frameworks are prevalent in distributed software systems as they simplify the exchange of data between applications running on different platforms. Messages are serialized and deserialized to transform user data structures into binary data for sending across the network. In a similar spirit, modern heterogenous computing platorms typically containing FPGAs can also profit from such messaging frameworks. Efficient compact serialization of data types is needed to take full advantage of the high throughput communication links. Transprecision extensions of FPGA replace native data types with novel low-precision data types. Transprecision extensions are shown to result in less-compact serializations. In this paper, we present a messaging framework for transprecision hardware accelerators which supports messages expressed in Protobuf and automatically generates serialization and deserialization functions. Our messageing framework leverages the varint encoding of Protocol buffers for efficient serialization and deserialization of transprecision data types. Evaluation results show that it can increase the effective throughput of OpenCAPI by up to $7.4 \times $ for various transprecision data-types.- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 98-106
PHRYCTORIA: A Messaging System for Transprecision OpenCAPI-attached FPGA Accelerators
Messaging frameworks are prevalent in distributed software systems as they simplify the exchange of data between applications running on different platforms. Messages are serialized and deserialized to transform user data structures into binary data for sending across the network. In a similar spirit, modern heterogenous computing platorms typically containing FPGAs can also profit from such messaging frameworks. Efficient compact serialization of data types is needed to take full advantage of the high throughput communication links. Transprecision extensions of FPGA replace native data types with novel low-precision data types. Transprecision extensions are shown to result in less-compact serializations. In this paper, we present a messaging framework for transprecision hardware accelerators which supports messages expressed in Protobuf and automatically generates serialization and deserialization functions. Our messageing framework leverages the varint encoding of Protocol buffers for efficient serialization and deserialization of transprecision data types. Evaluation results show that it can increase the effective throughput of OpenCAPI by up to $7.4 \times $ for various transprecision data-types.- 8 August 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 403-415
Low Precision Processing for High Order Stencil Computations
- 8 August 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 403-415
Low Precision Processing for High Order Stencil Computations
- 31 March 2015
- Published by Springer Nature
- p. 117-128
Dynamic Memory Management in Vivado-HLS for Scalable Many-Accelerator Architectures
- 31 March 2015
- Published by Springer Nature
- p. 117-128
Dynamic Memory Management in Vivado-HLS for Scalable Many-Accelerator Architectures
- Open Access
- 1 January 2012
- Published by Wiley in VLSI Design
- Vol. 2012 (1)
A Systematic Methodology for Reliability Improvements on SoC‐Based Software Defined Radio Systems
Shrinking silicon technologies, increasing logic densities and clock frequencies, lead to a rapid elevation in power density. Increased power density results in higher onchip temperature, which creates numerous problems tightly firmed to reliability degradation. Since typical low‐power design has been proved inefficient to tackle the temperature increment by itself, device architects are facing the challenge of developing new methodologies to guarantee timing, power, and thermal integrity of the chip. In this paper, we propose a thermal‐aware exploration framework targeting temperature hotspots elimination through the efficient exploration of multiple microarchitecture selections over the temperature‐area trade‐off curve. By carefully planning at design time the resources of the initial microarchitecture that should be replicated, the proposed methodology optimizes the system’s thermal profile and attens on‐chip temperature under various design constraints. The introduced framework does not impose any architectural or compiler modification, whereas it is orthogonal to any other thermal‐aware methodology. For evaluation purposes, we employ the software‐defined radio executed onto a thermal‐aware instance of LEON3 processor. Based on experimental results, we found that our methodology leads to an architecture that exhibits temperature reduction of 17 Kelvin degrees, which leads to improvement against aging phenomena about 14%, with a controllable overhead in silicon area about 15%, compared to the initial LEON3 instance.
- 1 January 2012
- Published by Wiley in VLSI Design
- Vol. 2012 (1)
Open AccessA Systematic Methodology for Reliability Improvements on SoC‐Based Software Defined Radio Systems
Shrinking silicon technologies, increasing logic densities and clock frequencies, lead to a rapid elevation in power density. Increased power density results in higher onchip temperature, which creates numerous problems tightly firmed to reliability degradation. Since typical low‐power design has been proved inefficient to tackle the temperature increment by itself, device architects are facing the challenge of developing new methodologies to guarantee timing, power, and thermal integrity of the chip. In this paper, we propose a thermal‐aware exploration framework targeting temperature hotspots elimination through the efficient exploration of multiple microarchitecture selections over the temperature‐area trade‐off curve. By carefully planning at design time the resources of the initial microarchitecture that should be replicated, the proposed methodology optimizes the system’s thermal profile and attens on‐chip temperature under various design constraints. The introduced framework does not impose any architectural or compiler modification, whereas it is orthogonal to any other thermal‐aware methodology. For evaluation purposes, we employ the software‐defined radio executed onto a thermal‐aware instance of LEON3 processor. Based on experimental results, we found that our methodology leads to an architecture that exhibits temperature reduction of 17 Kelvin degrees, which leads to improvement against aging phenomena about 14%, with a controllable overhead in silicon area about 15%, compared to the initial LEON3 instance.