| http://dbpedia.org/ontology/abstract
|
In computer science, a concurrent data str … In computer science, a concurrent data structure is aparticular way of storing and organizing data for access bymultiple computing threads (or processes) on a computer. Historically, such data structures were used on uniprocessormachines with operating systems that supported multiplecomputing threads (or processes). The term concurrency captured themultiplexing/interleaving of the threads' operations on thedata by the operating system, even though the processors neverissued two operations that accessed the data simultaneously. Today, as multiprocessor computer architectures that provideparallelism become the dominant computing platform (through theproliferation of multi-core processors), the term has come tostand mainly for data structures that can be accessed by multiplethreads which may actually access the data simultaneously becausethey run on different processors that communicate with one another.The concurrent data structure (sometimes also called a shared data structure) is usually considered to reside in an abstract storageenvironment called shared memory, though this memory may bephysically implemented as either a "tightly coupled" or adistributed collection of storage modules.distributed collection of storage modules.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.ibm.com/developerworks/aix/library/au-multithreaded_structures1/index.html +
, http://www.ibm.com/developerworks/aix/library/au-multithreaded_structures2/index.html +
, http://libcds.sourceforge.net/ +
, https://sites.google.com/site/synchrobench/ +
|
| http://dbpedia.org/ontology/wikiPageID
|
25175778
|
| http://dbpedia.org/ontology/wikiPageLength
|
8980
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1104905959
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Linear_Temporal_Logic +
, http://dbpedia.org/resource/Parallel_computing +
, http://dbpedia.org/resource/Serializability +
, http://dbpedia.org/resource/Maurice_Herlihy +
, http://dbpedia.org/resource/Nancy_Lynch +
, http://dbpedia.org/resource/Non-blocking_algorithm +
, http://dbpedia.org/resource/Synchronization_%28computer_science%29 +
, http://dbpedia.org/resource/Uniprocessor +
, http://dbpedia.org/resource/Spinlock +
, http://dbpedia.org/resource/Multiplexing +
, http://dbpedia.org/resource/Concurrency_%28computer_science%29 +
, http://dbpedia.org/resource/Process_%28computing%29 +
, http://dbpedia.org/resource/Nir_Shavit +
, http://dbpedia.org/resource/Operating_systems +
, http://dbpedia.org/resource/Gustafson%27s_law +
, http://dbpedia.org/resource/Multi-core +
, http://dbpedia.org/resource/Cache_coherence +
, http://dbpedia.org/resource/Category:Distributed_data_structures +
, http://dbpedia.org/resource/Speedup +
, http://dbpedia.org/resource/Amdahl%27s_law +
, http://dbpedia.org/resource/Sequential_consistency +
, http://dbpedia.org/resource/Thread_%28computer_science%29 +
, http://dbpedia.org/resource/Doug_Lea +
, http://dbpedia.org/resource/Java_ConcurrentMap +
, http://dbpedia.org/resource/Hagit_Attiya +
, http://dbpedia.org/resource/Multiprocessing +
, http://dbpedia.org/resource/Shared_memory_architecture +
, http://dbpedia.org/resource/Blocking_%28computing%29 +
, http://dbpedia.org/resource/Linearizability +
, http://dbpedia.org/resource/Java_concurrency +
, http://dbpedia.org/resource/Method_%28computer_science%29 +
, http://dbpedia.org/resource/Consensus_%28computer_science%29 +
, http://dbpedia.org/resource/Multiprocessor +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Refimprove +
, http://dbpedia.org/resource/Template:Use_dmy_dates +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Distributed_data_structures +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Way +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Concurrent_data_structure?oldid=1104905959&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Concurrent_data_structure +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.09gnszy +
, http://dbpedia.org/resource/Concurrent_data_structure +
, http://yago-knowledge.org/resource/Concurrent_data_structure +
, https://global.dbpedia.org/id/4i3n1 +
, http://www.wikidata.org/entity/Q5159104 +
, http://sr.dbpedia.org/resource/%D0%9A%D0%BE%D0%BD%D0%BA%D1%83%D1%80%D0%B5%D0%BD%D1%82%D0%BD%D0%B5_%D1%81%D1%82%D1%80%D1%83%D0%BA%D1%82%D1%83%D1%80%D0%B5_%D0%BF%D0%BE%D0%B4%D0%B0%D1%82%D0%B0%D0%BA%D0%B0 +
|
| rdf:type |
http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/WikicatDataStructures +
, http://dbpedia.org/class/yago/Cognition100023271 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Structure105726345 +
, http://dbpedia.org/class/yago/DataStructure105728493 +
, http://dbpedia.org/class/yago/Arrangement105726596 +
|
| rdfs:comment |
In computer science, a concurrent data str … In computer science, a concurrent data structure is aparticular way of storing and organizing data for access bymultiple computing threads (or processes) on a computer. Historically, such data structures were used on uniprocessormachines with operating systems that supported multiplecomputing threads (or processes). The term concurrency captured themultiplexing/interleaving of the threads' operations on thedata by the operating system, even though the processors neverissued two operations that accessed the data simultaneously.ons that accessed the data simultaneously.
|
| rdfs:label |
Concurrent data structure
|
