Concurrent data structure

Known as: Parallel data structure, Shared, Shared data structure 
In computer science, a concurrent data structure is aparticular way of storing and organizing data for access bymultiple computing threads (or… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Concurrent data structures are a fundamental building block for scalable multi-threaded programs. While Transactional Memory (TM… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2013
2013
No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means Limit of… (More)
  • table 1.1
Is this relevant?
2013
2013
Writing low-level concurrent software has traditionally required intimate knowledge of the entire toolchain and often has… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie… (More)
  • figure 3
  • figure 5
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We describe PSketch, a program synthesizer that helps programmers implement concurrent data structures. The system is based on… (More)
  • figure 7
  • figure 8
  • table 1
  • figure 10
  • figure 9
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Practical and efficient algorithms for concurrent data structures are difficult to construct and modify. Algorithms in the… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Sun Microsystems Laboratories 1.1 Designing Concurrent Data Structures . . . . . . . . . . . . . 1-1 Performance • Blocking… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.5
  • figure 1.6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. This is in contrast… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Will reading habit influence your life? Many say yes. Reading vlsi architecture for concurrent data structures is a good habit… (More)
Is this relevant?