Pierre LaBorde


Pierre LaBorde
Send Mail

Biography

Pierre LaBorde received his Bachelor of Science (2011), and Master of Science (2013), in Computer Science from the University of Central Florida, and is currently pursuing his PhD in Computer Science at UCF. His work mainly focuses on developing concurrent, lock-free and wait-free, data structures. His research interests include: Data Structures, Multicore Programming, Practical Non-Blocking Synchronization, Locking Algorithms, Hardware Transactional Memory, Distributed Computing.

Projects

TLDS: Transactional Lock-free Data Structures

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.

CCSpec

CCSpec is a tool that allows the user to check that their concurrent data structure meets a specified correctness condition. A correctness condition for a concurrent data structure defines the expected behavior of method calls. CCSpec can check any correctness condition in which a concurrent data structure is expected to exhibit equivalent behavior to the sequential counterpart.

Tervel

Tervel is a framework and library that unifies methodologies and techniques to enable the efficient implementation of wait-free algorithms. It includes a unified memory reclamation structure, progress assurance scheme, and a construct that limits recursive helping. It advocates a call-back centric design pattern to reduce code duplication, observable states, and improve code readability.

Publications

2018

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.
Publisher's Page

2017

Publications in Refereed Journals

Pierre LaBorde, Steven Feldman, Damian Dechev, A Wait-Free Hash Map, International Journal of Parallel Programming (IJPP), Springer, 45(3): 421-448, 2017.
Publisher's Page

2015

Publications in Refereed Journals

Steven Feldman, Pierre LaBorde, Damian Dechev, A Wait-Free Multi-Word Compare-and-Swap Operation, International Journal of Parallel Programming (IJPP), Springer, 43(4): 572596, February 2015.
Publisher's Page

Publications in Conference Proceedings

Steven Feldman, Pierre LaBorde, Damian Dechev, Tervel: A Unification of Descriptor-based Techniques for Non-blocking Programming, In Proceedings of the 15th IEEE International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XV), Samos, Greece, July 2015.
Publisher's Page

2013

Publications in Refereed Journals

Damian Dechev, Pierre LaBorde, Steven Feldman, LC/DC: Lockless Containers and Data Concurrency: A Novel Nonblocking Container Library for Multicore Applications, IEEE Access, 1: 428-435, September 2013.
Publisher's Page

Publications in Conference Proceedings

Steven Feldman, Akshatha Bhat, Pierre LaBorde, Qing Yi, Damian Dechev, Effective Use of Non-blocking Data Structures in a Deduplication Application, In Proceedings of the 4th ACM Conference on Systems, Programming, Languages and Applications: Software for Humanity (ACM SPLASH/Wavefront 2013), Indianapolis, IN, October 2013.
Publisher's Page

Steven Feldman, Pierre LaBorde, Damian Dechev, A Practical Wait-Free Multi-Word Compare-and-Swap Operation, In Proceedings of the Many-Core Architecture Research Community Symposium, ACM Conference on Systems, Programming, Languages and Applications: Software for Humanity (ACM SPLASH/MARC 2013), Indianapolis, IN, October 2013.
Publisher's Page

Steven Feldman, Pierre LaBorde, Damian Dechev, Concurrent Multi-level Arrays: Wait-free Extensible Hash Maps, In Proceedings of the 13th IEEE International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIII), Samos, Greece, July 2013, Acceptance Rate 20%, Best Paper Award.
Publisher's Page

2011

Workshop Participation

Steven Feldman, Pierre LaBorde, Damian Dechev, A Lock-Free Concurrent Hash Table Design for Effective Information Storage and Retrieval on Large Data Sets, In Proceedings of the Fifteenth Annual High Performance Embedded Computing Workshop (HPEC 2011), MIT Lincoln Laboratory, Lexington, MA, September 2011.
Publisher's Page