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

Naoki Yasuno

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

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

Systems, architecture and hardware · 2 · 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
1 paper
Cloud and datacenter computing · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › virtualization
hypervisor scheduling
0.712023
Revisiting VM-Agnostic KVM vCPU Scheduler for Mitigating Excessive vCPU Spinning · IEEE Trans. Parallel Distributed Syst. 2023
Cloud and datacenter computing › cluster resource management and scheduling › resource scheduling
vCPU scheduling
0.712023
Revisiting VM-Agnostic KVM vCPU Scheduler for Mitigating Excessive vCPU Spinning · IEEE Trans. Parallel Distributed Syst. 2023
Cloud and datacenter computing
virtualization
0.712023
Revisiting VM-Agnostic KVM vCPU Scheduler for Mitigating Excessive vCPU Spinning · IEEE Trans. Parallel Distributed Syst. 2023

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

rescheduling · 1.3hardware virtualization support · 1.3
YearPublicationVenuePosition
2023 Revisiting VM-Agnostic KVM vCPU Scheduler for Mitigating Excessive vCPU Spinning
abstract
In virtualized environments, virtual CPUs (vCPUs) are commonly oversubscribed on physical CPUs (pCPUs) to utilize CPU resources efficiently. However, excessive vCPU spinning, which occurs when a vCPU is waiting in a spin loop for an event from a descheduled vCPU, greatly degrades application performance in virtualized environments. VM-agnostic hypervisors aim to prevent excessive vCPU spinning by rescheduling vCPUs when an excessive spin is detected by hardware support for virtualization. We investigate the effectiveness of the KVM vCPU scheduler and show that it fails to avoid excessive vCPU spinning under various situations. We identify three problems: 1) scheduler mismatch, 2) aggressive limitation of candidate vCPUs, and 3) IPI context misuse. The first problem stems from the mismatch between the KVM vCPU scheduler and the Linux scheduler. The second and third problems come from failures in choosing candidate vCPUs to be scheduled next. Our in-depth analysis reveals simple modification to KVM (89 LoC) can mitigate excessive vCPU spinning. Our simple modification reduces excessive vCPU spinning by up to 96% and improves benchmark performance by up to 2.6×. Part of the proposed mitigation has been integrated with KVM from Linux KVM v5.13 onward.
Kenta Ishiguro, Naoki Yasuno, Pierre-Louis Aublin, Kenji Kono
IEEE Trans. Parallel Distributed Syst.2
2021 Mitigating excessive vCPU spinning in VM-agnostic KVM
abstract
In virtualized environments, oversubscribing virtual CPUs (vCPUs) on physical CPUs (pCPUs) is common to utilize CPU resources efficiently. Unfortunately, excessive vCPU spinning, which occurs when a vCPU is waiting in a spin loop for an event from a descheduled vCPU, causes serious performance degradation. Usually, the VM-agnostic hypervisor tries to prevent excessive vCPU spinning by rescheduling vCPUs when an excessive spin is detected by hardware support for virtualization.
Kenta Ishiguro, Naoki Yasuno, Pierre-Louis Aublin, Kenji Kono
VEE2