This HTML5 document contains 31 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/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n4https://citeseerx.ist.psu.edu/viewdoc/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Naimi-Trehel_algorithm
rdfs:label
Naimi-Trehel algorithm
rdfs:comment
Naimi-Trehel algorithm is an algorithm for achieving mutual exclusion in a distributed system.Unlike Lamport's distributed mutual exclusion algorithm and its related version, this algorithm does not use logical clocks.This method requires only O(Log(number of processes in the network)) messages on average.When a process invokes a critical section, it sends a request to a queue at a particular processor which is specified by a path built by the algorithm as it runs.
dcterms:subject
dbc:Concurrency_control_algorithms dbc:Distributed_computing
dbo:wikiPageID
70879247
dbo:wikiPageRevisionID
1113750624
dbo:wikiPageWikiLink
dbr:Critical_section dbc:Distributed_computing dbr:Big_O_notation dbr:Queue dbr:Lamport's_distributed_mutual_exclusion_algorithm dbr:Distributed_system dbc:Concurrency_control_algorithms dbr:Logical_clock dbr:Algorithm dbr:Mutual_exclusion
dbo:wikiPageExternalLink
n4:download%3Fdoi=10.1.1.39.5594&rep=rep1&type=pdf
owl:sameAs
n14:GRWPG wikidata:Q112316645
dbp:wikiPageUsesTemplate
dbt:More_citations_needed dbt:Comp-sci-stub dbt:Disambiguation_needed
dbo:abstract
Naimi-Trehel algorithm is an algorithm for achieving mutual exclusion in a distributed system.Unlike Lamport's distributed mutual exclusion algorithm and its related version, this algorithm does not use logical clocks.This method requires only O(Log(number of processes in the network)) messages on average.When a process invokes a critical section, it sends a request to a queue at a particular processor which is specified by a path built by the algorithm as it runs.
prov:wasDerivedFrom
wikipedia-en:Naimi-Trehel_algorithm?oldid=1113750624&ns=0
dbo:wikiPageLength
890
foaf:isPrimaryTopicOf
wikipedia-en:Naimi-Trehel_algorithm
Subject Item
dbr:Naimi-Trehel's_algorithm
dbo:wikiPageWikiLink
dbr:Naimi-Trehel_algorithm
dbo:wikiPageRedirects
dbr:Naimi-Trehel_algorithm
Subject Item
dbr:Naimi-Trehel's_log(n)_Algorithm
dbo:wikiPageWikiLink
dbr:Naimi-Trehel_algorithm
dbo:wikiPageRedirects
dbr:Naimi-Trehel_algorithm
Subject Item
wikipedia-en:Naimi-Trehel_algorithm
foaf:primaryTopic
dbr:Naimi-Trehel_algorithm