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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
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#
n5http://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Intersection_algorithm
rdf:type
dbo:Software
rdfs:label
Intersection algorithm
rdfs:comment
The intersection algorithm is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources. It forms part of the modern Network Time Protocol. It is a modified form of Marzullo's algorithm.
owl:sameAs
yago-res:Intersection_algorithm freebase:m.04nhyz
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description
dct:subject
dbc:Agreement_algorithms
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
n5:Intersection_algorithm?oldid=1018187196&ns=0
dbo:wikiPageID
1266240
dbo:wikiPageLength
4080
dbo:wikiPageRevisionID
1018187196
dbo:wikiPageWikiLink
dbr:Noise dbr:Network_Time_Protocol dbr:Jitter dbr:Confidence_and_prediction_bands dbr:Marzullo's_algorithm dbc:Agreement_algorithms
dbo:abstract
The intersection algorithm is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources. It forms part of the modern Network Time Protocol. It is a modified form of Marzullo's algorithm. While Marzullo's algorithm will return the smallest interval consistent with the largest number of sources, the returned interval does not necessarily include the center point (calculated offset) of all the sources in the intersection. The intersection algorithm returns an interval that includes that returned by Marzullo's algorithm but may be larger since it will include the center points. This larger interval allows using additional statistical data to select a point within the interval, reducing the jitter in repeated execution.
foaf:isPrimaryTopicOf
n5:Intersection_algorithm