אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Locks are frequently used in concurrent systems to simplify code and ensure safe access to contended parts of memory. However, they are also known to cause bottlenecks in concurrent code, leading practitioners and theoreticians to sometimes opt for more intricate lock-free implementations. In this talk, I’ll show that, despite the seeming contradiction, it is possible to design practically and theoretically efficient lock-free locks; I'll present a lock-free lock algorithm with good bounds on running time and fairness.