Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Smoothsort

Related Topics

In the News (Wed 26 Apr 17)

  Encyclopedia: Smoothsort
The smoothsort sorting algorithm is a variation of heapsort developed by Edsger Dijkstra in 1981.
The advantage of smoothsort is that it works in O(n) time if the input is (almost) sorted.
The structure of this algorithm, hereinafter referred to simply as smoothsort, is similar to that of column sort; both algorithms make progress by ensuring that under a certain....
www.nationmaster.com /encyclopedia/Smoothsort   (344 words)

 Citations: Efficient Computation on Sparse Interconnection Networks - Plaxton (ResearchIndex)   (Site not responding. Last check: 2007-09-07)
Note that column sort could well be a useful component of a hybrid sorting scheme that automatically selects an appropriate algorithm depending upon the values of n and p.
There are a number of variants of the smoothsort algorithm, all of which are described in
There are several variants of the smoothsort algorithm, all of which are described in
citeseer.ist.psu.edu /context/18096/0   (3402 words)

The price paid by these single-step algorithms is an irregular communication scheme and difficulty with load balancing.
The other group of sorting algorithms is the multi-step algorithms, which include bitonic sort [9], column sort [22], rotate sort [25], hyperquicksort [28], flashsort [29], B-flashsort [20], smoothsort [27], and Tridgell and Brent's sort [32].
Generally speaking, these algorithms accept multiple rounds of communication in return for better load balancing and, in some cases, regular communication.
www.umiacs.umd.edu /research/EXPAR/papers/3669/node1.html   (773 words)

 smoothsort - OneLook Dictionary Search   (Site not responding. Last check: 2007-09-07)
We found 2 dictionaries with English definitions that include the word smoothsort:
Tip: Click on the first link on a line below to go directly to a page where "smoothsort" is defined.
smoothsort : Dictionary of Algorithms and Data Structures [home, info]
www.onelook.com /?w=smoothsort   (78 words)

 E.W.Dijkstra Archive: Trip report E.W.Dijkstra, Marktoberdorf, 26/7 - 10/8/81 (EWD 799)
All my lectures had been scheduled at the beginning of the day, an arrangement which would have been OK if I had talked on six separate topics.
Now it was a handicap and for the presentation of smoothsort I needed four lectures instead of the intended three.
At that occasion a remark by Susan Owicki prompted the removal of my original reductio at absurdum; this time Luigi Lorippo (from the University of Ottawa) came up with a more general proof showing that on an infinite network starvation was impossible.
www.cs.utexas.edu /users/EWD/transcriptions/EWD07xx/EWD799.html   (1343 words)

 Load Balancing, Selection and Sorting on the Hypercube - Plaxton (ResearchIndex)   (Site not responding. Last check: 2007-09-07)
Abstract: This paper presents novel load balancing, selection and sorting algorithms for the hypercube with 1-port communication.
The main result is an algorithm for sorting n values on p processors, SmoothSort, that runs asymptotically faster (in the worst case) than any previously known algorithm over a wide range of the ratio n=p.
The load balancing and selection algorithms upon which SmoothSort is based are expected to be of independent interest.
citeseer.lcs.mit.edu /plaxton89load.html   (592 words)

 Citations: the Use of Smoothsort and Stochastic Move-to-front Operations for Optimal List Organization - Oommen ...   (Site not responding. Last check: 2007-09-07)
Citations: the Use of Smoothsort and Stochastic Move-to-front Operations for Optimal List Organization - Oommen (ResearchIndex)
Oommen, B. On the Use of Smoothsort and Stochastic Move-to-front Operations for Optimal List Organization.
Each test consisted of the average of ten trials consisting of 4; 000 accesses on a list of words distributed one of three ways (s i is the probability of access) DIST1: s i = k....
citeseer.ist.psu.edu /context/242617/0   (336 words)

 An Evaluation of Sorting as a Supercomputer Benchmark   (Site not responding. Last check: 2007-09-07)
In addition to Bitonic sort, there are several other sorting algorithms that have oblivious routing patterns.
Out of these both columnsort [24] and smoothsort [13] are reasonably practical when the number of keys is much larger than the number of processors (for p processors, columnsort requires keys to run most efficiently).
Columnsort has been implemented on the CM-5 with running times that were not as fast as some of other sorts on the CM-5 (including radix and sample sorts), but which for a large number of keys were within a factor of 2 of the best running times [
www.thearling.com /text/nasa/nasa.htm   (7535 words)

Try your search on: Qwika (all wikis)

  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.