BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Scalable Synchronization Mechanisms for Manycore Op
 erating Systems
DTSTART:20200305T101500
DTEND:20200305T111500
DTSTAMP:20260406T194632Z
UID:cf947429fc54be186ae8d3c498c838a43386adb81b5d46811268f2d6
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Sanidhya Kashyap - Georgia Institute of Technology\nIC Fac
 ulty candidate\n\nAbstract:\nWith the increasing demand for big data proce
 ssing\, we have seen tremendous growth in the adoption and commoditization
  of many-core machines that span beyond hundreds of hardware threads over 
 the past decade. Even cloud providers are offering such large machines to 
 allow users to process data as quickly as possible. To efficiently utilize
  such resources\, developers rely on various synchronization mechanisms as
  essential building blocks for designing high-performance many-core applic
 ations.\n \nIn this talk\, I will focus on designing new synchronization 
 mechanisms for highly concurrent software: the operating system. First\, I
  will show that existing locking primitives are a big deterrent to the sca
 lability of the operating system. Then\, I will present a new methodology 
 to build scalable and practical locking algorithms that break the decade-o
 ld convention of coupling lock's hardware/software policies and implementa
 tion. The family of locks I propose\, not only have the least memory footp
 rint but also the highest throughput for any thread count. Second\, I will
  present another scalability problem that occurs in existing timestamp-bas
 ed algorithms\, such as concurrency control mechanisms and concurrent data
  structure frameworks. I will address this issue with a scalable timestamp
 ing primitive by providing an illusion of a global clock\, thereby making 
 such algorithms many-core friendly. Finally\, I will end the talk with my 
 vision for building evolving services for operating systems to incorporate
  the fast-changing hardware as well as software.\n\nBio:\nSanidhya Kashyap
  is a Ph.D. candidate in the School of Computer Science at Georgia Tech\, 
 advised by Taesoo Kim at Georgia Tech and Changwoo Min at Virginia Tech. H
 is research interests are broadly in the area of systems with a focus on d
 esigning scalable and robust systems software. His thesis focuses on revis
 iting the design of synchronization primitives and their impact across sof
 tware stack. His works have won two best paper awards and found more than 
 250 bugs in the Linux file systems.\n\nMore information\n 
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CANCELLED
END:VEVENT
END:VCALENDAR