Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,495,985 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Amdahl's law
Blocking (computing)
Cache coherence
Compare-and-swap
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Multiroot: Towards Memory-Efficient Router Virtualization
Thilan Ganegedara
,
Weirong Jiang
,
V. Prasanna
IEEE International Conference on Communications…
2011
Corpus ID: 17291308
Network virtualization has become a powerful scheme to make efficient use of networking hardware. It allows multiple virtual…
Expand
2008
2008
A FLIGHT SIMULATOR FOR ATF2 - A MECHANISM FOR INTERNATIONAL COLLABORATION IN THE WRITING AND DEPLOYMENT OF ONLINE BEAM DYNAMICS ALGORITHMS *†
G. White
,
Lal Orsay
,
+7 authors
Y. Rénier
2008
Corpus ID: 12106530
Abstract The goals of ATF2 are to test a novel compact final focus optics design with local chromaticity correction intended for…
Expand
2002
2002
Compositionality in Functional Bulk Synchronous Parallelism
F. Loulergue
2002
Corpus ID: 15832681
The BSλp-calculus an extension of the λ-calculus by bulk synchronous parallel (BSP) operations on a parallel data structure named…
Expand
2002
2002
A parallel mixed time integration algorithm for nonlinear dynamic analysis
A. Rao
2002
Corpus ID: 62600190
Highly Cited
2001
Highly Cited
2001
An XML-based middleware for peer-to-peer computing
C. Mascolo
,
L. Capra
,
W. Emmerich
Proceedings First International Conference on…
2001
Corpus ID: 16800734
An increasing number of distributed applications will be written for mobile hosts, such as laptop computers, third generation…
Expand
Review
1999
Review
1999
Reducing hot-spot contention in shared-memory multiprocessor systems
S. Dandamudi
IEEE Concurrency
1999
Corpus ID: 14231535
In shared-memory multiprocessor systems that use multistage interconnection networks, memory contention can produce "tree…
Expand
1998
1998
ParList: A Parallel Data Structure for Dynamic Load Balancing
F. Feschet
,
S. Miguet
,
Laurent Perroton
J. Parallel Distributed Comput.
1998
Corpus ID: 26355782
1996
1996
Testing concurrent data structures
J. Bruno
,
Phillip B. Gibbons
,
S. Phillips
ACM SIGACT-SIGOPS Symposium on Principles of…
1996
Corpus ID: 26728198
A concurrent data structure isadata object shared by concurrent asynchronous processes. During a run of a parallel/distributed…
Expand
Review
1990
Review
1990
Transient finite element computations on 65536 processors: The connection machine
C. Farhat
,
N. Sobh
,
K. Park
1990
Corpus ID: 62731550
This paper reports on our experience in solving large-scale finite element transient problems on the Connection Machine. We begin…
Expand
Highly Cited
1989
Highly Cited
1989
Recursive *-tree parallel data-structure
O. Berkman
,
U. Vishkin
30th Annual Symposium on Foundations of Computer…
1989
Corpus ID: 46315787
The authors introduce a fundamentally novel parallel data structure, called recursive *-tree (star tree). For its definition…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE