"Concurrent Data Structures" seminar by Professor Faith Ellen.
A concurrent data structure is a data structure on which multiple processes can act simultaneously. Otherwise, it is called a sequential data structure. A library of concurrent data structures can make the task of developing concurrent software much easier. Although sequential data structures can be transformed into concurrent data structures in straightforward ways, the results are generally inefficient and/or not fault tolerant. I'll discuss some of the difficulties and techniques involved in constructing efficient concurrent data structures, including my recent work on balanced binary search trees.
Learn more about UTG events