On the way to efficient concurrent hash table
Nowadays, the hash table is probably the most used data structure, the performance of which influences many application’s components. However, is it that simple to write a fast implementation which uses all power of multi-core architectures? How efficient are the standard solutions in Java? We will try to get the answer to these and many other questions during this talk. We will touch on both theoretical aspects and some practical approaches for high-performance algorithms development.
Nikita works on algorithms for coroutines in the Kotlin team and has been getting a PhD at IST Austria. In addition, he teaches a course on concurrency programming and is interested in program analysis and verification.