This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n6https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Raymond's_algorithm
Subject Item
dbr:Lamport's_distributed_mutual_exclusion_algorithm
dbo:wikiPageWikiLink
dbr:Raymond's_algorithm
Subject Item
dbr:Raymond's_algorithm
rdf:type
yago:Activity100407535 yago:Event100029378 yago:Algorithm105847438 dbo:RugbyPlayer yago:PsychologicalFeature100023100 yago:Rule105846932 yago:Procedure101023820 yago:WikicatConcurrencyControlAlgorithms yago:Abstraction100002137 yago:YagoPermanentlyLocatedEntity yago:Act100030358
rdfs:label
Raymond's algorithm
rdfs:comment
Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed resources. As defined, each node has only a single parent, to which all requests to attain the token are made.
dcterms:subject
dbc:Concurrency_control_algorithms
dbo:wikiPageID
14351683
dbo:wikiPageRevisionID
1122392515
dbo:wikiPageWikiLink
dbr:Ricart-Agrawala_algorithm dbc:Concurrency_control_algorithms dbr:Lamport's_bakery_algorithm dbr:Suzuki-Kasami's_algorithm dbr:FIFO_(computing_and_electronics) dbr:Distributed_system dbr:Mutual_exclusion dbr:Critical_section dbr:Maekawa's_algorithm dbr:Naimi-Trehel's_algorithm dbr:K-ary_tree dbr:Lamport's_distributed_mutual_exclusion_algorithm
owl:sameAs
n6:4twxx wikidata:Q7298516 freebase:m.03d1cbp yago-res:Raymond's_algorithm
dbo:abstract
Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed resources. As defined, each node has only a single parent, to which all requests to attain the token are made.
gold:hypernym
dbr:Lock
prov:wasDerivedFrom
wikipedia-en:Raymond's_algorithm?oldid=1122392515&ns=0
dbo:wikiPageLength
2366
foaf:isPrimaryTopicOf
wikipedia-en:Raymond's_algorithm
Subject Item
dbr:Maekawa's_algorithm
dbo:wikiPageWikiLink
dbr:Raymond's_algorithm
Subject Item
dbr:Raymond's_Algorithm
dbo:wikiPageWikiLink
dbr:Raymond's_algorithm
dbo:wikiPageRedirects
dbr:Raymond's_algorithm
Subject Item
dbr:Ricart–Agrawala_algorithm
dbo:wikiPageWikiLink
dbr:Raymond's_algorithm
Subject Item
wikipedia-en:Raymond's_algorithm
foaf:primaryTopic
dbr:Raymond's_algorithm