Moshe Malka

dblp:159/0043 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 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
1 paper
Memory systems · 87% Storage systems · 13%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%
Computer networks
1 paper
Software-defined and programmable networks · 100%
Network and information security
1 paper
Hardware security and side channels · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory management › memory management unit
IOMMU
0.212015
rIOMMU: Efficient IOMMU for I/O Devices that Employ Ring Buffers · ASPLOS 2015
Memory systems › memory management
virtual memory
0.212015
rIOMMU: Efficient IOMMU for I/O Devices that Employ Ring Buffers · ASPLOS 2015
Software-defined and programmable networks
SDN controller
0.112015
rIOMMU: Efficient IOMMU for I/O Devices that Employ Ring Buffers · ASPLOS 2015
Hardware security and side channels › hardware attacks
DMA attacks
0.112015
Efficient Intra-Operating System Protection Against Harmful DMAs · FAST 2015

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

translation lookaside buffer design · 0.7IOTLB optimization · 0.7IOMMU · 0.4
YearPublicationVenuePosition
2015 rIOMMU: Efficient IOMMU for I/O Devices that Employ Ring Buffers
abstract
The IOMMU allows the OS to encapsulate I/O devices in their own virtual memory spaces, thus restricting their DMAs to specific memory pages. The OS uses the IOMMU to protect itself against buggy drivers and malicious/errant devices. But the added protection comes at a cost, degrading the throughput of I/O-intensive workloads by up to an order of magnitude. This cost has motivated system designers to trade off some safety for performance, e.g., by leaving stale information in the IOTLB for a while so as to amortize costly invalidations. We observe that high-bandwidth devices---like network and PCIe SSD controllers---interact with the OS via circular ring buffers that induce a sequential, predictable workload. We design a ring IOMMU (rIOMMU) that leverages this characteristic by replacing the virtual memory page table hierarchy with a circular, flat table. A flat table is adequately supported by exactly one IOTLB entry, making every new translation an implicit invalidation of the former and thus requiring explicit invalidations only at the end of I/O bursts. Using standard networking benchmarks, we show that rIOMMU provides up to 7.56x higher throughput relative to the baseline IOMMU, and that it is within 0.77--1.00x the throughput of a system without IOMMU protection.
Moshe Malka, Nadav Amit, Muli Ben-Yehuda, Dan Tsafrir
ASPLOS1
2015 Efficient Intra-Operating System Protection Against Harmful DMAs
Moshe Malka, Nadav Amit, Dan Tsafrir
FAST1