Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

An Efficient Wait-Free Vector

Journal Article · · IEEE Transactions on Parallel and Distributed Systems
 [1];  [1];  [2]
  1. Univ. of Central Florida, Orlando, FL (United States)
  2. Univ. of Central Florida, Orlando, FL (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)

The vector is a fundamental data structure, which provides constant-time access to a dynamically-resizable range of elements. Currently, there exist no wait-free vectors. The only non-blocking version supports only a subset of the sequential vector API and exhibits significant synchronization overhead caused by supporting opposing operations. Since many applications operate in phases of execution, wherein each phase only a subset of operations are used, this overhead is unnecessary for the majority of the application. To address the limitations of the non-blocking version, we present a new design that is wait-free, supports more of the operations provided by the sequential vector, and provides alternative implementations of key operations. These alternatives allow the developer to balance the performance and functionality of the vector as requirements change throughout execution. Compared to the known non-blocking version and the concurrent vector found in Intel’s TBB library, our design outperforms or provides comparable performance in the majority of tested scenarios. Over all tested scenarios, the presented design performs an average of 4.97 times more operations per second than the non-blocking vector and 1.54 more than the TBB vector. In a scenario designed to simulate the filling of a vector, performance improvement increases to 13.38 and 1.16 times. This work presents the first ABA-free non-blocking vector. Finally, unlike the other non-blocking approach, all operations are wait-free and bounds-checked and elements are stored contiguously in memory.

Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1427291
Report Number(s):
SAND--2015-2906J; 583297
Journal Information:
IEEE Transactions on Parallel and Distributed Systems, Journal Name: IEEE Transactions on Parallel and Distributed Systems Journal Issue: 3 Vol. 27; ISSN 1045-9219
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

Similar Records

Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Journal Article · Wed Sep 14 00:00:00 EDT 2016 · Journal of the Association for Computing Machinery · OSTI ID:1557574

Effective Software Design and Development for the New Graph Architecture HPC Machines
Technical Report · Fri Mar 16 20:00:00 EDT 2012 · OSTI ID:1039407

Reversible Parallel Discrete Event Formulation of a TLM-based Radio Signal Propagation Model
Journal Article · Fri Dec 31 23:00:00 EST 2010 · ACM Transactions on Modeling and Computer Simulation · OSTI ID:1043925