BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Scalable Synchronization Mechanisms for Manycore Op
 erating Systems
DTSTART:20200406T140000
DTEND:20200406T150000
DTSTAMP:20260407T110632Z
UID:532a4a4c7cc01c29c6b759c42ce9da578eb12c420fc8dab91b6d6fe0
CATEGORIES:Conferences - Seminars
DESCRIPTION:This talk will take place via zoom. Please click on the follow
 ing link:  https://epfl.zoom.us/j/887423892\n\nBy: Sanidhya Kashyap - Geo
 rgia Tech\nIC Faculty candidate\n\nAbstract\nIn this talk\, I will focus o
 n designing new synchronization mechanisms for highly concurrent software:
  the operating system. First\, I will show that existing locking primitive
 s are a big deterrent to the scalability of the operating system. Then\, I
  will present a new methodology to build scalable and practical locking al
 gorithms that break the decade-old convention of coupling lock's hardware/
 software policies and implementation. The family of locks I propose\, not 
 only have the least memory footprint but also the highest throughput for a
 ny thread count. Second\, I will present another scalability problem that 
 occurs in existing timestamp-based algorithms\, such as concurrency contro
 l mechanisms and concurrent data structure frameworks. I will address this
  issue with a scalable timestamping primitive by providing an illusion of 
 a global clock\, thereby making such algorithms many-core friendly. Finall
 y\, I will end the talk with my vision for building evolving services for 
 operating systems to incorporate the fast-changing hardware as well as sof
 tware.\n\nBio\nSanidhya Kashyap is a Ph.D. candidate in the School of Comp
 uter Science at Georgia Tech\, advised by Taesoo Kim at Georgia Tech and C
 hangwoo Min at Virginia Tech. His research interests are broadly in the ar
 ea of systems with a focus on designing scalable and robust systems softwa
 re. His thesis focuses on revisiting the design of synchronization primiti
 ves and their impact across software stack. His works have won two best pa
 per awards and found more than 250 bugs in the Linux file systems.\n\nMore
  information
LOCATION:
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR
