The RCU-reader preemption problem in VMS

Prasad, A and Gopinath, K and McKenney, PE (2019) The RCU-reader preemption problem in VMS. In: 2017 USENIX Annual Technical Conference, USENIX ATC 2017, 12 - 14 July 2017, Santa Clara, pp. 265-270.

PDF USENIXATC_2019.pdf - Published Version Restricted to Registered users only Download (701kB) | Request a copy

Abstract

When synchronization primitives such as locking and read-copy update (RCU) execute within virtual machines (VMs), preemption can cause multi-second latency spikes, increasing peak memory footprint and fragmentation inside VMs, which in turn may trigger swapping or VM ballooning. The resulting CPU utilization and memory footprint increases can negate the server-consolidation benefits of virtualization. Although preemption of lock holders in VMs has been well-studied, the corresponding solutions do not apply to RCU due to its exceedingly lightweight read-side primitives. This paper presents the first evaluation of RCU-reader preemption in a virtualized environment. Our evaluation shows 50% increase in the peak memory footprint and 155% increase in fragmentation for a microbenchmark, 23.71% increase in average kernel CPU utilization, 2.9× increase in the CPU time to compute a grace period and 2.18× increase in the average grace period duration for the Postmark benchmark.

Item Type:	Conference Paper
Publication:	Proceedings of the 2017 USENIX Annual Technical Conference, USENIX ATC 2017
Publisher:	USENIX Association
Additional Information:	The copyright for this article belongs to USENIX Association.
Keywords:	Virtual reality, Corresponding solutions; CPU time; CPU utilization; Memory footprint; Micro-benchmark; Server consolidation; Synchronization primitive; Virtualized environment, Locks (fasteners)
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	28 Nov 2022 07:13
Last Modified:	28 Nov 2022 07:13
URI:	https://eprints.iisc.ac.in/id/eprint/78046

Actions (login required)

View Item