COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Deadlock Immunity: Teaching Systems How To Defend Against Deadlocks
Deadlock Immunity: Teaching Systems How To Defend Against DeadlocksAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Eiko Yoneki. Deadlock immunity is a property by which programs, once afflicted by a given deadlock, develop resistance against future occurrences of that and similar deadlocks. I will describe a technique that enables programs to automatically gain such immunity without assistance from programmers or users. We implemented this approach for both Java and POSIX threads and evaluated it with several real systems, including MySQL, JBoss, SQLite, Apache ActiveMQ, Limewire, and Java JDK . The results demonstrate effectiveness against real, reported deadlock bugs, while incurring modest performance overhead and scaling to 1024 threads. I will discuss how deadlock immunity can offer programmers and users an attractive tool for coping with elusive deadlocks, as well as present extensions of the immunity idea to other types of failures. BIO : George Candea has been an Asst. Professor of Computer Science at EPFL since Fall 2006. He established the Dependable Systems Lab, where he leads research on tools and frameworks for engineering reliable, highly available, manageable computer systems. He is also Chief Scientist of Aster Data Systems, a large-scale data analytics company he co-founded in 2005. George received the Top 35 Young Technology Innovators award conferred by the MIT Technology Review in 2005. In 2001, George was part of the founding team of the Recovery-Oriented Computing (ROC) project. Between 1998-2003, George worked at Oracle Corp. in the distributed systems and caching division; previously, he held intern positions at IBM Research and Microsoft Research. George received his PhD in computer science from Stanford University in 2005 and his BS (1997) and MEng (1998) in computer science from the Massachusetts Institute of Technology. This talk is part of the Computer Laboratory Systems Research Group Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCU Palestine Society Nanoscience Centre Seminar Series CMS Special LecturesOther talksMicrotubule Modulation of Myocyte Mechanics Intrinsically Motivating Teachers;STIR's use of Data Driven Insight to Iterate, Pivot and (where necessary) Fail Fast Introduction to Biomolecular NMR NatHistFest: the 99th Conversazione and exhibition on the wonders of the natural world. Simulating wave propagation in elastic systems using the Finite-Difference-Time-Domain method Prof Chris Rapley (UCL): Polar Climates mTORC1 signaling coordinates different POMC neurons subpopulations to regulate feeding Migration in Science Refugees and Migration Fields of definition of Fukaya categories of Calabi-Yau hypersurfaces 70th Anniversary Celebration Cafe Synthetique- AI and Automation: Revolutionising Biology |