Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dimitrios Mbakoyiannis

dblp:217/4036 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
GPUs and heterogeneous computing · 33% Parallel and multicore computing · 27% Reconfigurable computing and FPGAs · 20%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming runtimes
0.412020
Efficient Job Offloading in Heterogeneous Systems Through Hardware-Assisted Packet-Based Dispatching and User-Level Runtime Infrastructure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Energy-efficient computing › energy-efficient architecture
energy-efficient accelerator
0.312018
Energy-Performance Considerations for Data Offloading to FPGA-Based Accelerators Over PCIe · ACM Trans. Archit. Code Optim. 2018
Reconfigurable computing and FPGAs
FPGA accelerator
0.312018
Energy-Performance Considerations for Data Offloading to FPGA-Based Accelerators Over PCIe · ACM Trans. Archit. Code Optim. 2018

Methods — techniques the papers use, named apart from their topics

unified virtual memory · 0.4packet-based dispatching · 0.4zero-copy transfer · 0.3scatter-gather DMA · 0.3
YearPublicationVenuePosition
2020 Towards holistic secure networking in connected vehicles through securing CAN-bus communication and firmware-over-the-air updating
Othon Tomoutzoglou, Dimitrios Mbakoyiannis, Nikolas Karadimitriou, Marcello Coppola, Eleonora Montanari, Ioannis A. Deligiannis, Giovanni Gherardi
J. Syst. Archit.3
2020 Efficient Job Offloading in Heterogeneous Systems Through Hardware-Assisted Packet-Based Dispatching and User-Level Runtime Infrastructure
abstract
Emerging heterogeneous systems architectures increasingly integrate general-purpose processors, GPUs, and other specialized computational units to provide both power and performance benefits. While the motivations for developing systems with accelerators are clear, it is important to design efficient dispatching mechanisms in terms of performance and energy while leveraging programmability and orchestration of the diverse computational components. In this paper, we present an infrastructure composed of a hardware, general, packet-based processing-dispatching unit, named generic packet processing unit (GPPU), and of an associated runtime that facilitates userlevel access to GPPU objects, such as packets, queues, and contexts. Hence, we remove drawbacks of traditional costly userto-kernel-level operations, low-level accelerator subtleties that hinder programming productivity, along with architectural obstacles such as handling accelerators' unified virtual address space. We present the design and evaluation of our framework by integrating the GPPU infrastructure with data streaming type accelerators, image filtering, and matrix multiplication, tightly coupled to ARMv8 architecture via unified virtual memory. Under scaling workload our proposed dispatching methods can deliver 3.7× performance improvement over baseline offloading, and up to 4.7× better energy efficiency.
Othon Tomoutzoglou, Dimitrios Mbakoyiannis, Marcello Coppola
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2018 Energy-Performance Considerations for Data Offloading to FPGA-Based Accelerators Over PCIe
abstract
Modern data centers increasingly employ FPGA-based heterogeneous acceleration platforms as a result of their great potential for continued performance and energy efficiency. Today, FPGAs provide more hardware parallelism than is possible with GPUs or CPUs, whereas C-like programming environments facilitate shorter development time, even close to software cycles. In this work, we address limitations and overheads in access and transfer of data to accelerators over common CPU-accelerator interconnects such as PCIe. We present three different FPGA accelerator dispatching methods for streaming applications (e.g., multimedia, vision computing). The first uses zero-copy data transfers and on-chip scratchpad memory (SPM) for energy efficiency, and the second uses also zero-copy but shared copy engines among different accelerator instances and local external memory. The third uses the processor’s memory management unit to acquire the physical address of user pages and uses scatter-gather data transfers with SPM. Even though all techniques exhibit advantages in terms of scalability and relieve the processor from control overheads through using integrated schedulers, the first method presents the best energy-efficient acceleration in streaming applications.
Dimitrios Mbakoyiannis, Othon Tomoutzoglou
ACM Trans. Archit. Code Optim.1