rIOMMU: Efficient IOMMU for I/O Devices that Employ Ring Buffers

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 hi-erarchy 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 re-quiring explicit invalidations only at the end of I/O bursts. Us-ing standard networking benchmarks, we show that rIOMMU provides up to 7.56x higher throughput relative to the base-line IOMMU, and that it is within 0.77–1.00x the throughput of a system without IOMMU protection. Categories and Subject Descriptors B.3.2 [memory struc-tures]: design styles—virtual memory; B.4.2 [I/O and data communications]: I/O devices—channels and controllers; D.4.2 [operating systems]: storage management—virtual memory, allocation/deallocation strategies General Terms design, experimentation, performanc