Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming

Authors

Josh Triplett, Portland State University
Paul E. McKenneyFollow
Jonathan Walpole, Portland State UniversityFollow

Document Type

Presentation

Publication Date

6-2011

Subjects

Functional programming (Computer science), High performance computing, Parallel processing (Electronic computers), Electronic data processing -- Distributed processing

Abstract

Presentation focusing on software synchronization, thread locking, transactional memory, and relativistic programming. Hash table algorithms are presented with examples of relativistic list insertion and removal, and related data structures. Existing approaches are compared to new methodologies and future work with relativistic data structures.

Description

Presentation made to the USENIX Annual Technical Conference (USENIX ATC'11), Portland, Oregon, June 2011.

Persistent Identifier

http://archives.pdx.edu/ds/psu/10632

Citation Details

Josh Triplett, Paul E. McKenney, and Jonathan Walpole, "Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming" (2011). Presentation to USENIX Annual Technical Conference (USENIX ATC'11).