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
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-srhttp://sr.dbpedia.org/resource/
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/
dbphttp://dbpedia.org/property/
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:Chaitin's_algorithm
Subject Item
dbr:Gregory_Chaitin
dbo:wikiPageWikiLink
dbr:Chaitin's_algorithm
dbp:knownFor
dbr:Chaitin's_algorithm
dbo:knownFor
dbr:Chaitin's_algorithm
Subject Item
dbr:Spill_metric
dbo:wikiPageWikiLink
dbr:Chaitin's_algorithm
Subject Item
dbr:Optimizing_compiler
dbo:wikiPageWikiLink
dbr:Chaitin's_algorithm
Subject Item
dbr:Chaitin's_algorithm
rdf:type
yago:Activity100407535 yago:Rule105846932 yago:YagoPermanentlyLocatedEntity yago:Event100029378 yago:Algorithm105847438 yago:Act100030358 yago:Abstraction100002137 yago:Procedure101023820 yago:WikicatGraphAlgorithms dbo:Software yago:PsychologicalFeature100023100
rdfs:label
Chaitin's algorithm
rdfs:comment
Chaitin's algorithm is a bottom-up, graph coloring register allocation algorithm that uses cost/degree as its spill metric. It is named after its designer, Gregory Chaitin. Chaitin's algorithm was the first register allocation algorithm that made use of coloring of the for both register allocations and spilling.
dcterms:subject
dbc:Graph_algorithms
dbo:wikiPageID
1778619
dbo:wikiPageRevisionID
1055320679
dbo:wikiPageWikiLink
dbr:Interference_graph dbr:Spill_metric dbr:Graph_coloring dbr:SIGPLAN dbc:Graph_algorithms dbr:Register_allocation dbr:Algorithm dbr:Gregory_Chaitin
owl:sameAs
yago-res:Chaitin's_algorithm freebase:m.05w678 dbpedia-sr:Čejtinov_algoritam n18:4gxtT wikidata:Q5068133
dbp:wikiPageUsesTemplate
dbt:Cite_journal dbt:Algorithm-stub
dbo:abstract
Chaitin's algorithm is a bottom-up, graph coloring register allocation algorithm that uses cost/degree as its spill metric. It is named after its designer, Gregory Chaitin. Chaitin's algorithm was the first register allocation algorithm that made use of coloring of the for both register allocations and spilling. Chaitin's algorithm was presented on the 1982 SIGPLAN Symposium on Compiler Construction, and published in the symposium proceedings. It was extension of an earlier 1981 paper on the use of graph coloring for register allocation. Chaitin's algorithm formed the basis of a large section of research into register allocators.
gold:hypernym
dbr:Graph
prov:wasDerivedFrom
wikipedia-en:Chaitin's_algorithm?oldid=1055320679&ns=0
dbo:wikiPageLength
979
foaf:isPrimaryTopicOf
wikipedia-en:Chaitin's_algorithm
Subject Item
dbr:Chaitin_algorithm
dbo:wikiPageWikiLink
dbr:Chaitin's_algorithm
dbo:wikiPageRedirects
dbr:Chaitin's_algorithm
Subject Item
dbr:Register_coloring
dbo:wikiPageWikiLink
dbr:Chaitin's_algorithm
dbo:wikiPageRedirects
dbr:Chaitin's_algorithm
Subject Item
dbr:Register_colouring
dbo:wikiPageWikiLink
dbr:Chaitin's_algorithm
dbo:wikiPageRedirects
dbr:Chaitin's_algorithm
Subject Item
wikipedia-en:Chaitin's_algorithm
foaf:primaryTopic
dbr:Chaitin's_algorithm