Changing Paravirt Lock-ops for a Changing World
Offered By: Linux Foundation via YouTube
Course Description
Overview
Explore the evolution of paravirtualized lock operations in this 26-minute conference talk by Ankur Arora from Oracle. Delve into the challenges and solutions for making guest systems more dynamic, focusing on the pv_lock_ops state-machine and queued spinlocks based on MCS locks. Examine the reasons behind not universally adopting paravirt locks and the complexities involved in switching pv_lock_ops. Learn about the mechanisms for patching active systems, including the INT3 approach and two versions of design implementations. Gain insights into global barriers, counting techniques, and actual code examples. Conclude with a Q&A session to address any remaining questions on this crucial aspect of virtualization technology.
Syllabus
Introducción
Guests should be more dynamic
pv_lock_ops state-machine Queued spinlocks are based on MCS locks
Why don't we just use paravirt locks all the time
What does switching pv_lock_ops involve? cont
Active users while we are patching
Mechanism: INT3
V1: approach
V1: state-machine
V2 design: global barrier
V2 design: more on counting
Show me the code
Questions?
Taught by
Linux Foundation
Tags
Related Courses
Using Coccinelle to Detect and Fix Nested Execution Context ViolationsLinux Foundation via YouTube Inside Waits, Latches, and Spinlocks Returns
PASS Data Community Summit via YouTube Multicore Synchronization - The Lesser-Known Primitives
CppNow via YouTube Reliable Userspace Spinlock Implementation in Linux
Linux Foundation via YouTube RON - One-Way Circular Shortest Routing to Achieve Efficient and Bounded-Waiting Spinlocks
USENIX via YouTube