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.

Pirmin Vogel

dblp:145/7552 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2019
0000-0002-9657-736XORCID · corroborated

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

Systems, architecture and hardware · 5 · 4 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
Memory systems · 81% Reconfigurable computing and FPGAs · 12% Integrated circuit design · 4%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › memory management
virtual memory
0.722019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Lightweight Virtual Memory Support for Zero-Copy Sharing of Pointer-Rich Data Structures in Heterogeneous Embedded SoCs · IEEE Trans. Parallel Distributed Syst. 2017
Memory systems › memory management › virtual memory
address translation
0.412019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Reconfigurable computing and FPGAs
FPGA accelerator
0.412019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Memory systems › memory management › memory management unit
IOMMU
0.412019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Memory systems › virtual memory management
shared virtual memory
0.412019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Memory systems › memory management › virtual memory › address translation
TLB
0.412019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Integrated circuit design
system-on-chip
0.112019
Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU · IEEE Trans. Computers 2019
Embedded and real-time systems › embedded hardware platform
heterogeneous system-on-chip
0.112017
Lightweight Virtual Memory Support for Zero-Copy Sharing of Pointer-Rich Data Structures in Heterogeneous Embedded SoCs · IEEE Trans. Parallel Distributed Syst. 2017

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

hardware-software co-design · 0.4
YearPublicationVenuePosition
2019 Exploring Shared Virtual Memory for FPGA Accelerators with a Configurable IOMMU
abstract
A key enabler for the ever-increasing adoption of FPGA accelerators is the availability of frameworks allowing for the seamless coupling to general-purpose host processors. Embedded FPGA+CPU systems still heavily rely on copy-based host-to-accelerator communication, which complicates application development. In this paper, we present a hardware/software framework for enabling transparent, shared virtual memory for FPGA accelerators in embedded SoCs. It can use a hard-macro IOMMU if available, or a configurable soft-core IOMMU that we provide. We explore different TLB configurations and provide a comparison with other designs for shared virtual memory to gain insight on performance-critical IOMMU components. Experimental results using pointer-rich benchmarks show that our framework not only simplifies FPGA-accelerated application development, it also achieves up to 13x speedup compared to traditional copy-based offloading.
Pirmin Vogel, Andrea Marongiu, Luca Benini
IEEE Trans. Computers1
2018 Scalable and Efficient Virtual Memory Sharing in Heterogeneous SoCs with TLB Prefetching and MMU-Aware DMA Engine
abstract
Shared virtual memory (SVM) is key in heterogeneous systems on chip (SoCs), which combine a general-purpose host processor with a many-core accelerator, both for programmability and to avoid data duplication. However, SVM can bring a significant run time overhead when translation lookaside buffer (TLB) entries are missing. Moreover, allowing DMA burst transfers to write SVM traditionally requires buffers to absorb transfers that miss in the TLB. These buffers have to be overprovisioned for the maximum burst size, wasting precious on-chip memory, and stall all SVM accesses once they are full, hampering the scalability of parallel accelerators. In this work, we present our SVM solution that avoids the majority of TLB misses with prefetching, supports parallel burst DMA transfers without additional buffers, and can be scaled with the workload and number of parallel processors. Our solution is based on three novel concepts: To minimize the rate of TLB misses, the TLB is proactively filled by compiler-generated Prefetching Helper Threads, which use run-time information to issue timely prefetches. To reduce the latency of TLB misses, misses are handled by a variable number of parallel Miss Handling Helper Threads. To support parallel burst DMA transfers to SVM without additional buffers, we add lightweight hardware to a standard DMA engine to detect and react to TLB misses. Compared to the state of the art, our work improves accelerator performance for memory-intensive kernels by up to 4~ and by up to 60% for irregular and regular memory access patterns, respectively.
Andreas Kurth, Pirmin Vogel, Andrea Marongiu, Luca Benini
ICCD2
2017 Efficient Virtual Memory Sharing via On-Accelerator Page Table Walking in Heterogeneous Embedded SoCs
abstract
Shared virtual memory is key in heterogeneous systems on chip (SoCs) that combine a general-purpose host processor with a many-core accelerator, both for programmability and performance. In contrast to the full-blown, hardware-only solutions predominant in modern high-end systems, lightweight hardware-software co-designs are better suited in the context of more power- and area-constrained embedded systems and provide additional benefits in terms of flexibility and predictability. As a downside, the latter solutions require the host to handle in software synchronization in case of page misses as well as miss handling. This may incur considerable run-time overheads. In this work, we present a novel hardware-software virtual memory management approach for many-core accelerators in heterogeneous embedded SoCs. It exploits anaccelerator-sidehelper thread concept that enables the accelerator to manage its virtual memory hardware autonomously while operating cache-coherently on the page tables of the user-space processes of the host. This greatly reduces overhead with respect to host-side solutions while retaining flexibility. We have validated the design with a set of parameterizable benchmarks and real-world applications covering various application domains. For purely memory-bound kernels, the accelerator performance improves by a factor of 3.8 compared with host-based management and lies within 50% of a lower-bound ideal memory management unit.
Pirmin Vogel, Andreas Kurth, Johannes Weinbuch, Andrea Marongiu, Luca Benini
ACM Trans. Embed. Comput. Syst.1
2017 Lightweight Virtual Memory Support for Zero-Copy Sharing of Pointer-Rich Data Structures in Heterogeneous Embedded SoCs
abstract
While high-end heterogeneous systems are increasingly supporting heterogeneous uniform memory access (hUMA), their low-power counterparts still lack basic features like virtual memory support for accelerators. Instead of simply passing pointers, explicit data management involving copies is needed which hampers programmability and performance. In this work, we evaluate a mixed hardware/software solution for lightweight virtual memory support for many-core accelerators in heterogeneous embedded systems-on-chip. Based on an input/output translation lookaside buffer managed by a host kernel-level driver, and compiler extensions protecting the accelerator's accesses to shared data, our solution is non-intrusive to the architecture of the accelerator cores, and enables zero-copy sharing of pointer-rich data structures.
Pirmin Vogel, Andrea Marongiu, Luca Benini
IEEE Trans. Parallel Distributed Syst.1
2014 Efficient parallel beamforming for 3D ultrasound imaging
abstract
One of the most demanding tasks in state-of-the-art medical ultrasound systems is the localization of possible scatterers in the body based on received echoes. Digital beamforming involves the summation of all received echoes in each image point according to their time of flight, i.e., their delay. This requires the knowledge of the delays for all combinations of ultrasound transmitters, image points and receivers. Recent three-dimensional (3D) systems comprise thousands of transducer elements and millions of image points. Compared to traditional 2D systems, the total number of delays is several orders of magnitude larger.
Pirmin Vogel, Andrea Bartolini, Luca Benini
ACM Great Lakes Symposium on VLSI1