Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,164,652 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.
2017
2017
Public auditing for shared data in cloud with safe user revocation
S. Samundiswary
,
Nilima Dongre Jawade
International conference of Electronics…
2017
Corpus ID: 22663054
Cloud computing is a most adopted emerging technology by all organizations. Data storage and sharing of data in cloud is the most…
Expand
2010
2010
Scalability comparison of commodity operating systems on multi-cores
Yan Cui
,
Yu Chen
,
Yuanchun Shi
,
Q. Wu
IEEE International Symposium on Performance…
2010
Corpus ID: 11058571
In this paper, we evaluate and compare the parallel scalability of three commodity operating systems (Linux, Solaris and FreeBSD…
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
2007
2007
A Unified Schema Matching Framework
Alsayed Algergawy
,
Eike Schallehn
,
G. Saake
Grundlagen von Datenbanken
2007
Corpus ID: 3239719
The proliferation of applications dealing with shared data radically increases the need to identify and discover the semantically…
Expand
2004
2004
Tuplespace-Based Collaboration for Bluetooth-Enabled Devices in Smart Environments
F. Siegemund
,
P. Keller
GI Jahrestagung
2004
Corpus ID: 3081823
Smart environments are often populated by resource-restricted devices that need to cooperate with each other in order to access…
Expand
2001
2001
Parallel relative debugging for distributed memory application: a case study
Greg Watson
,
D. Abramson
2001
Corpus ID: 15688666
Relative debugging is a technique that addresses the problem of debugging programs that have been developed using evolutionary…
Expand
1995
1995
Resilient distributed objects: Basic results and application to shared tuple spaces
E. Segall
Proceedings.Seventh IEEE Symposium on Parallel…
1995
Corpus ID: 5590411
Given a shared, atomic read-modify-write register r with deterministic operations, Herlihy (1991) has defined an interference…
Expand
Review
1992
Review
1992
The RACE Open Services Architecture Project
A. Oshisanwo
,
M. Chapman
,
M. Key
,
A. Mullery
,
Jacques Saint-Blancat
IBM Systems Journal
1992
Corpus ID: 43366303
The specification and implementation of current telecommunication services tend to be intimately bound to a specific network…
Expand
1991
1991
A parallel algorithm for ASN.1 encoding/decoding
C. Joseph
1991
Corpus ID: 61557639
Computers differ in many ways: the characters may be coded in ASCII, EBCDIC or UNICODE; integers can vary in size; processors can…
Expand
1990
1990
A Family of 2-process Mutual Exclusion Algorithms
J. Misra
1990
Corpus ID: 17273225
In Peterson [1981], Peterson suggested a mutual exclusion algorithm. The algorithm, though simple in structure, seems quite…
Expand