An Efficient Wait-Free Vector

@article{Feldman2016AnEW,
  title={An Efficient Wait-Free Vector},
  author={Steven D. Feldman and Carlos Valera-Leon and Damian Dechev},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  year={2016},
  volume={27},
  pages={654-667}
}
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… CONTINUE READING
3 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

The Art of Multiprocessor Programming

  • M. Herlihy, N. Shavit
  • 2011
Highly Influential
8 Excerpts

A method for implementing lock-free shared-data structures,

  • G. Barnes
  • Proc. 5th Annu. ACM Symp. Parallel Algorithms…
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…