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

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

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-kohttp://ko.dbpedia.org/resource/
dbpedia-eshttp://es.dbpedia.org/resource/
dbpedia-globalhttps://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ruhttp://ru.dbpedia.org/resource/
dbpedia-ukhttp://uk.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n11http://www.cs.utexas.edu/users/witchel/372/lectures/
freebasehttp://rdf.freebase.com/ns/
n6http://research.microsoft.com/en-us/um/people/lamport/pubs/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-ithttp://it.dbpedia.org/resource/
dbpedia-zhhttp://zh.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Bully_algorithm
rdfs:seeAlso
dbr:Bandwidth_(computing)
owl:sameAs
dbpedia-global:4reQa dbpedia-uk:Алгоритм_хулігана dbpedia-ko:불리_알고리즘 dbpedia-fa:الگوریتم_قلدر dbpedia-de:Bullyalgorithmus dbpedia-ru:Алгоритм_забияки dbpedia-it:Algoritmo_dello_spaccone wikidata:Q694171 yago-res:Bully_algorithm dbpedia-zh:霸道选举算法 dbpedia-es:Algoritmo_abusón freebase:m.0601sf
rdfs:label
霸道选举算法 Алгоритм забияки Bully algorithm 불리 알고리즘 Bullyalgorithmus Algoritmo dello spaccone Алгоритм хулігана Algoritmo abusón
prov:wasDerivedFrom
wikipedia-en:Bully_algorithm?oldid=1250833310&ns=0
dbo:description
rekursiver, verteilter Alhorhithmus in der IT method for picking a coordinator from distributed computer processes, in which the process with the highest ID number among non-failed processes is picked metoda za izbiro koordinatorja med porazdeljenimi računalniškimi procesi, pri kateri se izbere proces z najvišjo identifikacijsko številko med procesi, ki niso bili neuspešni
dbo:wikiPageExternalLink
n6:byz.pdf n11:25.DistributedCoordination.ppt
dbo:wikiPageWikiLink
dbc:Graph_algorithms dbr:Distributed_computing dbr:Process_(computing) dbc:Distributed_algorithms dbr:Leader_election dbr:Liveness dbr:Synchronous dbr:Algorithm dbr:Chang_and_Roberts_algorithm
dct:subject
dbc:Graph_algorithms dbc:Distributed_algorithms
foaf:isPrimaryTopicOf
wikipedia-en:Bully_algorithm
dbp:wikiPageUsesTemplate
dbt:See_also dbt:Reflist dbt:Var dbt:Commonscatinline
Subject Item
wikipedia-en:Bully_algorithm
foaf:primaryTopic
dbr:Bully_algorithm
Subject Item
dbr:Chang_and_Roberts_algorithm
dbo:wikiPageWikiLink
dbr:Bully_algorithm
Subject Item
dbr:Leader_election
dbo:wikiPageWikiLink
dbr:Bully_algorithm
Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Bully_algorithm
Subject Item
dbr:Bully_Algorithm
dbo:wikiPageRedirects
dbr:Bully_algorithm
dbo:wikiPageWikiLink
dbr:Bully_algorithm