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

Marina Vemmou

dblp:253/7383 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021

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 · 67% Cloud and datacenter computing · 18% Parallel and multicore computing · 16%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache management
0.612022
Patching up Network Data Leaks with Sweeper · MICRO 2022
Cloud and datacenter computing
datacenter network
0.612022
Patching up Network Data Leaks with Sweeper · MICRO 2022
Memory systems › cache management
direct cache access
0.612022
Patching up Network Data Leaks with Sweeper · MICRO 2022
Memory systems › non-volatile memory
persistent memory
0.512021
COSPlay: Leveraging Task-Level Parallelism for High-Throughput Synchronous Persistence · MICRO 2021
Memory systems › non-volatile memory
persist ordering
0.512021
COSPlay: Leveraging Task-Level Parallelism for High-Throughput Synchronous Persistence · MICRO 2021
Parallel and multicore computing › parallelization strategies
task-level parallelism
0.512021
COSPlay: Leveraging Task-Level Parallelism for High-Throughput Synchronous Persistence · MICRO 2021

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

hardware extension · 0.6API · 0.6
YearPublicationVenuePosition
2022 Patching up Network Data Leaks with Sweeper
abstract
Datacenters have witnessed a staggering evolution in networking technologies, driven by insatiable application demands for larger datasets and inter-server data transfers. Modern NICs can already handle 100s of Gbps of traffic, a bandwidth capability equivalent to several memory channels. Direct Cache Access mechanisms like DDIO that contain network traffic inside the CPU’s caches are therefore essential to effectively handle growing network traffic rates. However, a growing body of work reveals instances of a critical DDIO weakness known as “leaky DMA”, occurring when a significant fraction of network traffic leaks from the CPU’s caches to memory. We find that such network data leaks cap the network bandwidth a server can effectively utilize. We identify that a major culprit for such network data leaks are evictions of already consumed dirty network buffers. Our key insight is that buffers already consumed by the application typically need not be written back to memory, as their next reuse will be a full overwrite with new network data by the NIC. We introduce Sweeper, a hardware extension and API that allows applications to mark such consumed network buffers. Hardware then skips writing marked buffers back to memory, drastically reducing memory bandwidth consumption and mitigating the performance penalty of network data leaks. Sweeper boosts a 24-core server’s peak sustainable network bandwidth by up to $2. 6 \times $ as compared to DDIO-based configurations.
Marina Vemmou, Albert Cho, Alexandros Daglis
MICRO1
2021 COSPlay: Leveraging Task-Level Parallelism for High-Throughput Synchronous Persistence
abstract
A key challenge in programming crash-consistent applications for Persistent Memory (PM) is achieving high performance while controlling the order of PM updates. Managing persist ordering from the CPU typically requires frequent synchronization points, which expose the PM’s high persist latency on the execution’s critical path. To mitigate this overhead, prior proposals relax the persistency model and decouple persistence from the program’s volatile execution, delegating persistence ordering to specialized hardware mechanisms such that persistent state lags behind volatile state. In this work, we identify the opportunity to mitigate the effect of persist latency by leveraging the task-level parallelism available in many PM applications, while preserving the stricter semantics of synchronous persistence and the familiar x86 persistency model.
Marina Vemmou, Alexandros Daglis
MICRO1