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

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

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n18	https://global.dbpedia.org/id/
yago	http://dbpedia.org/class/yago/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/
n15	http://supertech.csail.mit.edu/papers/

Statements

Subject Item

dbr:Cache-oblivious_distribution_sort

rdf:type

yago:PsychologicalFeature100023100 yago:Concept105835747 yago:WikicatComparisonSorts yago:YagoPermanentlyLocatedEntity yago:WikicatSortingAlgorithms yago:Event100029378 yago:Cognition100023271 yago:Algorithm105847438 yago:WikicatExternalMemoryAlgorithms yago:Rule105846932 yago:Kind105839024 yago:Abstraction100002137 yago:Idea105833840 yago:Act100030358 yago:Category105838765 yago:Activity100407535 yago:Procedure101023820 yago:Content105809192 yago:SortingAlgorithm105847658

rdfs:label

Cache-oblivious distribution sort

rdfs:comment

The cache-oblivious distribution sort is a comparison-based sorting algorithm. It is similar to quicksort, but it is a cache-oblivious algorithm, designed for a setting where the number of elements to sort is too large to fit in a cache where operations are done. In the external memory model, the number of memory transfers it needs to perform a sort of items on a machine with cache of size and cache lines of length is , under the tall cache assumption that . This number of memory transfers has been shown to be asymptotically optimal for comparison sorts. This distribution sort also achieves the asymptotically optimal runtime complexity of .

dcterms:subject

dbc:Cache_(computing) dbc:Analysis_of_algorithms dbc:External_memory_algorithms dbc:Comparison_sorts dbc:Sorting_algorithms dbc:Models_of_computation

dbo:wikiPageID

42794826

dbo:wikiPageRevisionID

928188122

dbo:wikiPageWikiLink

dbc:Analysis_of_algorithms dbc:Cache_(computing) dbc:Models_of_computation dbc:Sorting_algorithms dbr:Median_of_medians dbc:External_memory_algorithms dbr:Quicksort dbr:External_memory_model dbr:Cache_(computing) dbr:Sorting_algorithm dbr:Cache-oblivious_algorithm dbr:Funnelsort dbc:Comparison_sorts dbr:Comparison_sort dbr:External_sorting

dbo:wikiPageExternalLink

n15:Prokop99.pdf

owl:sameAs

yago-res:Cache-oblivious_distribution_sort freebase:m.010pdrf6 wikidata:Q17082367 n18:fDh3

dbp:wikiPageUsesTemplate

dbt:Multiple_issues dbt:Not_a_typo dbt:Technical dbt:Short_description dbt:Primary_sources

dbo:abstract

The cache-oblivious distribution sort is a comparison-based sorting algorithm. It is similar to quicksort, but it is a cache-oblivious algorithm, designed for a setting where the number of elements to sort is too large to fit in a cache where operations are done. In the external memory model, the number of memory transfers it needs to perform a sort of items on a machine with cache of size and cache lines of length is , under the tall cache assumption that . This number of memory transfers has been shown to be asymptotically optimal for comparison sorts. This distribution sort also achieves the asymptotically optimal runtime complexity of .

prov:wasDerivedFrom

wikipedia-en:Cache-oblivious_distribution_sort?oldid=928188122&ns=0

dbo:wikiPageLength

5972

foaf:isPrimaryTopicOf

wikipedia-en:Cache-oblivious_distribution_sort