Microsoft PowerPoint - Presentation.ppt1 Split-Ordered Lists: Lock- Free Extensible Hash Tables Gunnar Johansson Paper by Ori Shalev, Nir Shavit (Tel-Aviv University) Presentation outline �Motivation �The lock-free idea (basics) �Hash tables: Brief review �Solution �Results �Conclusions Motivation �Previous work shows that lock-free approaches are optimal for high concurrency �Many applications use hash tables �Requirements �Support fo
