Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Abstract In recent years, the computational fluid dynamics has been widely used in the aviation, weather, chemical industry and… 
2011
2011
A look at Exascale reveals a future with multicore supercomputers that will inexorably experience frequent failures. Providing… 
2010
2010
In this paper, we evaluate and compare the parallel scalability of three commodity operating systems (Linux, Solaris and FreeBSD… 
2008
2008
Abstract The goals of ATF2 are to test a novel compact final focus optics design with local chromaticity correction intended for… 
2007
2007
The proliferation of applications dealing with shared data radically increases the need to identify and discover the semantically… 
2004
2004
Smart environments are often populated by resource-restricted devices that need to cooperate with each other in order to access… 
1996
1996
A concurrent data structure isadata object shared by concurrent asynchronous processes. During a run of a parallel/distributed… 
1995
1995
  • E. J. Segall
  • 1995
  • Corpus ID: 5590411
Given a shared, atomic read-modify-write register r with deterministic operations, Herlihy (1991) has defined an interference… 
Review
1992
Review
1992
The specification and implementation of current telecommunication services tend to be intimately bound to a specific network… 
1986
1986
A design for a highly parallel data structure store for the prototype Manchester Dataflow Computer is presented. The main design…