Renato Mancuso

Renato Mancuso

Auto-generated profile, based on publicly available information

Renato Mancuso

Boston University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
8 May 2023
Verified
Conference Paper
Open access
ARAli Raza
Ali Raza
TUThomas Unger
Thomas Unger
MBMatthew Boyd
Matthew Boyd
EMEric B Munson
Eric B Munson
PSParul Sohal
Parul Sohal
OKOrran Krieger
Orran Krieger
This paper presents Unikernel Linux (UKL), a path toward integrating unikernel optimization techniques in Linux, a general purpose operating system. UKL adds a configuration option to Linux allowing for a single, optimized process to link with the kernel directly, and run at supervisor privilege. This UKL process does not require application source code modification, only a re-link with our, slightly modified, Linux kernel and glibc. Unmodified applications show modest performance gains out of the box, and developers can further optimize applications for more significant gains (e.g. 26% throughput improvement for Redis). UKL retains support for co-running multiple user level processes capable of communicating with the UKL process using standard IPC. UKL preserves Linux's battle-tested codebase, community, and ecosystem of tools, applications, and hardware support. UKL runs both on bare-metal and virtual servers and supports multi-core execution. The changes to the Linux kernel are modest (1250 LOC).

17 June 2024 in Real-Time Systems
Verified
Journal Article
Open access
PDF file
AZAlexander Zuepke
Alexander Zuepke
ABAndrea Bastoni
Andrea Bastoni
Weifan ChenWeifan Chen
Weifan Chen
MCMarco Caccamo
Marco Caccamo
RMRenato Mancuso
Renato Mancuso
In today’s multiprocessor systems-on-a-chip, the shared memory subsystem is a known source of temporal interference. The problem causes logically independent cores to affect each other’s performance, leading to pessimistic worst-case execution time analysis. Memory regulation via throttling is one of the most practical techniques to mitigate interference. Traditional regulation schemes rely on a combination of timer and performance counter interrupts to be delivered and processed on the same cores running real-time workload. Unfortunately, to prevent excessive overhead, regulation can only be enforced at a millisecond-scale granularity. In this work, we present a novel regulation mechanism from outside the cores that monitors performance counters for the application core’s activity in main memory at a microsecond scale. The approach is fully transparent to the applications on the cores, and can be implemented using widely available on-chip debug facilities. The presented mechanism also allows more complex composition of metrics to enact load-aware regulation. For instance, it allows redistributing unused bandwidth between cores while keeping the overall memory bandwidth of all cores below a given threshold. We implement our approach on a host of embedded platforms and conduct an in-depth evaluation on the Xilinx Zynq UltraScale+ ZCU102, NXP i.MX8M and NXP S32G2 platforms using the San Diego Vision Benchmark Suite.

13 May 2023 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
TKTomasz Kloda
Tomasz Kloda
GGGiovani Gracioli
Giovani Gracioli
RTRohan Tabish
Rohan Tabish
RMReza Mirosanlou
Reza Mirosanlou
RMRenato Mancuso
Renato Mancuso
MCMarco Caccamo
Marco Caccamo
Newly emerging multiprocessor system-on-a-chip (MPSoC) platforms provide hard processing cores with programmable logic (PL) for high-performance computing applications. In this article, we take a deep look into these commercially available heterogeneous platforms and show how to design mixed-criticality applications such that different processing components can be isolated to avoid contention on the shared resources such as last-level cache and main memory. Our approach involves software/hardware co-design to achieve isolation between the different criticality domains. At the hardware level, we use a scratchpad memory (SPM) with dedicated interfaces inside the PL to avoid conflicts in the main memory. At the software level, we employ a hypervisor to support cache-coloring such that conflicts at the shared L2 cache can be avoided. In order to move the tasks in/out of the SPM memory, we rely on a DMA engine and propose a new CPU-DMA co-scheduling policy, called Lazy Load , for which we also derive the response time analysis. The results of a case study on image processing demonstrate that the contention on the shared memory subsystem can be avoided when running with our proposed architecture. Moreover, comprehensive schedulability evaluations show that the newly proposed Lazy Load policy outperforms the existing CPU-DMA scheduling approaches and is effective in mitigating the main memory interference in our proposed architecture.

26 April 2022 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
PSParul Sohal
Parul Sohal
RTRohan Tabish
Rohan Tabish
UDUlrich Drepper
Ulrich Drepper
RMRenato Mancuso
Renato Mancuso

19 February 2021 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
DTDharmesh Tarapore
Dharmesh Tarapore
SRShahin Roozhkhosh
Shahin Roozhkhosh
SBSteven Brzozowski
Steven Brzozowski
RMRenato Mancuso
Renato Mancuso
The vast majority of high-performance embedded systems implement multi-level CPU cache hierarchies. But the exact behavior of these CPU caches has historically been opaque to system designers. Absent expensive hardware debuggers, an understanding of cache makeup remains tenuous at best. This enduring opacity further obscures the complex interplay among applications and OS-level components, particularly as they compete for the allocation of cache resources. Notwithstanding the relegation of cache comprehension to proxies such as static cache analysis, performance counter-based profiling, and cache hierarchy simulations, the underpinnings of cache structure and evolution continue to elude software-centric solutions. In this paper, we explore a novel method of studying cache contents and their evolution via snapshotting. Our method complements extant approaches for cache profiling to better formulate, validate, and refine hypotheses on the behavior of modern caches. We leverage cache introspection interfaces provided by vendors to perform live cache inspections without the need for external hardware. We present CacheFlow, a proof-of-concept Linux kernel module which snapshots cache contents on an NVIDIA Tegra TX1 system on chip.

1 May 2021
Verified
Conference Paper
Closed access
DHDenis Hoornaert
Denis Hoornaert
SRShahin Roozkhosh
Shahin Roozkhosh
RMRenato Mancuso
Renato Mancuso
MCMarco Caccamo
Marco Caccamo
In modern real-time multicore systems, understanding and adequately managing shared caches is essential to ensure the temporal isolation of critical tasks. Recent research has identified and extensively studied the sources of unpredictability imputable to shared caches, heavily promoting techniques such as cache partitioning and internal resources management. In this article, we highlight the existence of an enigmatic source of inter-core interference: the CPU-brainfreeze. Experiments realized on a development board show that benchmarks (selected from the San-Diego Vision Benchmark Suite) can exhibit up to a 10-fold increase in their execution time. The same experiment shows that for extreme cases, the core cluster can be stalled indefinitely.