Lance Lebanoff received his Bachelor of Science in Computer Science from the University of Central Florida in 2016, and is currently pursuing his PhD in Computer Science at UCF. His interests include parallel computing, non-blocking synchronization, transactional data structures, and parallel graph algorithms.
TLDS provides a framework for developing transactional containers from lock-free ones. It includes five examples of transactional data structures, lock-free and obstruction-free versions of a linked list, and a skip list, and a lock-free hash map. We are currently working on supporting transactional data structures for non-linked containers and also transactions that are executed on multiple containers.
Publications in Refereed Journals
Deli Zhang, Pierre LaBorde, Lance Lebanoff, Damian Dechev, Lock-free Transactional Transformation, ACM Transactions on Parallel Computing (ACM TOPC), Vol. 5, No. 1, Article 6, June 2018.