BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20230508T120000Z
UID:f3434ddc6fb098e442cceb1c404faec6-458
DTSTAMP:19700101T120016Z
DESCRIPTION:Handling competitive aspects of Synchronization in Shared Environments using lock usage fairness
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/458/handling-competitive-aspects-of-synchronization-in-shared-environments-using-lock-usage-fairness/
SUMMARY:In shared environments such as operating systems, multiple tenants with varied requirements compete to access the shared resources, making strong performance isolation necessary. Locks are one of the widely used synchronization primitives that provide mutual exclusion in such environments.
In this talk, I will emphasize the competitive aspects of synchronization in such shared environments. I will start by introducing the notion of lock usage -- a new lock property that deals with the time spent in the critical section. Then, I will show how unfair lock usage in shared environments leads to two new problems -- scheduler subversion and adversarial synchronization. I will then introduce two solutions -- Scheduler Cooperative Locks and Tratr that view synchronization as a resource to mitigate these two problems. Lastly, I will talk about our current work on ensuring hierarchical fairness using lock usage and the design of work-conservative Scheduler Cooperative Locks.
DTSTART:20230508T120000Z
END:VEVENT
END:VCALENDAR