About: Samplesort

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Samplesort Goto Sponge NotDistinct Permalink

An Entity of Type : yago:SortingAlgorithm105847658, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSamplesort

Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting algorithms partitions the array into sub-intervals or buckets. The buckets are then sorted individually and then concatenated together. However, if the array is non-uniformly distributed, the performance of these sorting algorithms can be significantly throttled. Samplesort addresses this issue by selecting a sample of size s from the n-element sequence, and determining the range of the buckets by sorting the sample and choosing p−1 < s elements from the result. These elements (called splitters) then divide the array into p approximately equal-sized buckets. Samplesort is described in the 1970 paper, "Samplesort: A Sampling Approach to

Attributes	Values
rdf:type	software yago:WikicatSortingAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:SortingAlgorithm105847658
rdfs:label	Samplesort (de) Samplesort (en)
rdfs:comment	Samplesort ist ein Sortieralgorithmus, der 1970 von W. D. Frazer und A. C. McKellar in der wissenschaftlichen Publikation Samplesort: A Sampling Approach to Minimal Storage Tree Sorting veröffentlicht wurde. Der Algorithmus arbeitet ähnlich wie Quicksort und verfolgt wie dieser das Teile-und-herrsche-Verfahren. Der Algorithmus teilt die Eingabesequenz in mehrere Teilsequenzen auf, die dann rekursiv sortiert werden. (de) Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting algorithms partitions the array into sub-intervals or buckets. The buckets are then sorted individually and then concatenated together. However, if the array is non-uniformly distributed, the performance of these sorting algorithms can be significantly throttled. Samplesort addresses this issue by selecting a sample of size s from the n-element sequence, and determining the range of the buckets by sorting the sample and choosing p−1 < s elements from the result. These elements (called splitters) then divide the array into p approximately equal-sized buckets. Samplesort is described in the 1970 paper, "Samplesort: A Sampling Approach to (en)
foaf:depiction
dcterms:subject	Sorting algorithms Distributed algorithms
Wikipage page ID	22405006 (xsd:integer)
Wikipage revision ID	1121170031 (xsd:integer)
Link from a Wikipage to another Wikipage	Predication (computer architecture) Quicksort GPGPU Branch misprediction Connection Machine Sorting algorithms Distributed computing Flashsort Oversampling Distributed algorithms Chernoff bound Big O notation Divide and conquer algorithm Bulk synchronous parallel Sorting algorithm Loop unrolling Sample (statistics) Distributed systems Multiprocessor Binary search
Link from a Wikipage to an external page	http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi=10.1.1.49.214 http://citeseer.ist.psu.edu/91922.html http://portal.acm.org/citation.cfm%3Fid=321600 https://doi.org/10.1007%2F3-540-60688-2_30 https://doi.org/10.1007%2FBF01931688
sameAs	Samplesort Samplesort Samplesort Samplesort Samplesort Samplesort
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Math dbt:Mvar dbt:R dbt:Reflist dbt:Sorting
thumbnail	wiki-commons:Special:FilePath/Parallelersamplesort.svg?width=300
has abstract	Samplesort ist ein Sortieralgorithmus, der 1970 von W. D. Frazer und A. C. McKellar in der wissenschaftlichen Publikation Samplesort: A Sampling Approach to Minimal Storage Tree Sorting veröffentlicht wurde. Der Algorithmus arbeitet ähnlich wie Quicksort und verfolgt wie dieser das Teile-und-herrsche-Verfahren. Der Algorithmus teilt die Eingabesequenz in mehrere Teilsequenzen auf, die dann rekursiv sortiert werden. (de) Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting algorithms partitions the array into sub-intervals or buckets. The buckets are then sorted individually and then concatenated together. However, if the array is non-uniformly distributed, the performance of these sorting algorithms can be significantly throttled. Samplesort addresses this issue by selecting a sample of size s from the n-element sequence, and determining the range of the buckets by sorting the sample and choosing p−1 < s elements from the result. These elements (called splitters) then divide the array into p approximately equal-sized buckets. Samplesort is described in the 1970 paper, "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting", by W. D. Frazer and A. C. McKellar. (en)
gold:hypernym	Algorithm
prov:wasDerivedFrom	wikipedia-en:Samplesort?oldid=1121170031&ns=0
page length (characters) of wiki page	21821 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Samplesort
is Link from a Wikipage to another Wikipage of	Proportion extend sort Quicksort List of algorithms Sorting algorithm Sample sort
is Wikipage redirect of	Sample sort
is foaf:primaryTopic of	wikipedia-en:Samplesort

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 42 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software