Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Samplesort> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Samplesort abstract "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 m -1 elements from the result. These elements (called splitters) then divide the sample into m 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.".
- Samplesort wikiPageExternalLink 91922.html.
- Samplesort wikiPageExternalLink summary?doi=10.1.1.49.214.
- Samplesort wikiPageExternalLink citation.cfm?id=321600.
- Samplesort wikiPageExternalLink l211p1q526j84174.
- Samplesort wikiPageExternalLink p70564506802n575.
- Samplesort wikiPageID "22405006".
- Samplesort wikiPageLength "7224".
- Samplesort wikiPageOutDegree "13".
- Samplesort wikiPageRevisionID "700433070".
- Samplesort wikiPageWikiLink Bulk_synchronous_parallel.
- Samplesort wikiPageWikiLink Category:Distributed_algorithms.
- Samplesort wikiPageWikiLink Category:Sorting_algorithms.
- Samplesort wikiPageWikiLink Connection_Machine.
- Samplesort wikiPageWikiLink Distributed_computing.
- Samplesort wikiPageWikiLink Divide_and_conquer_algorithms.
- Samplesort wikiPageWikiLink Flashsort.
- Samplesort wikiPageWikiLink General-purpose_computing_on_graphics_processing_units.
- Samplesort wikiPageWikiLink Multiprocessing.
- Samplesort wikiPageWikiLink Quicksort.
- Samplesort wikiPageWikiLink Sample_(statistics).
- Samplesort wikiPageWikiLink Sorting_algorithm.
- Samplesort wikiPageWikiLinkText "Samplesort".
- Samplesort wikiPageUsesTemplate Template:Math.
- Samplesort wikiPageUsesTemplate Template:Mvar.
- Samplesort wikiPageUsesTemplate Template:R.
- Samplesort wikiPageUsesTemplate Template:Reflist.
- Samplesort wikiPageUsesTemplate Template:Sorting.
- Samplesort subject Category:Distributed_algorithms.
- Samplesort subject Category:Sorting_algorithms.
- Samplesort hypernym Algorithm.
- Samplesort type Software.
- Samplesort type Algorithm.
- Samplesort comment "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 label "Samplesort".
- Samplesort sameAs Q182425.
- Samplesort sameAs Samplesort.
- Samplesort sameAs m.05sxnzt.
- Samplesort sameAs Q182425.
- Samplesort wasDerivedFrom Samplesort?oldid=700433070.
- Samplesort isPrimaryTopicOf Samplesort.