Abstract
Some kind of discrete data sets can be practically transformed into uniform by the related distribution function. By addressing the sparsity of data which measures the discreteness, this paper demonstrates that the sparsity decides the uniformity of the transformed data, and that could be a good reason to explain both the success of the bucket sort in PennySort 2003 and the failure for the same algorithm with the data modified. So the sparsity provides a good criterion to predict whether the algorithm works or not.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Knuth, D.E.: The Art of Computer Programming, vol3: Sorting and Searching, pp. 506–549. Addison-Wesley Inc., Reading (1973)
Sort Benchmark homepage, http://research.microsoft.com/barc/SortBenchmark/
Gray, J., Coates, J., Nyberg, C.: Performance/price sort and PennySort. Technical Report, MS-TR-98-45, Microsoft Research (1998)
Yang, L., Huang, H., Song, T.: The sample-seperator based distributing scheme of the external bucket sort algorithm. Journal of Software 16(5), 643–651 (2005)
Giri, N.C.: Introduction to Probability and Statistics, ch. 3: Random variables, probability distributions and characteristic functions, 2nd edn., pp. 55–135. Marcel Dekker Inc., New York (1993)
Wade, W.R.: An Introduction to Analysis, ch. 1: The real number system, 2nd edn., pp. 1–33. Prentice-Hall International Inc, Upper Saddle River (2000)
Evans, M., Hastings, N., Peacock, B.: Statistical Distributions, ch. 2: Terms and symbols, 3rd edn., pp. 3–17. John Wiley & Sons, Inc., New York (2000)
Shi, Y., Zhang, L., Liu, P.: THSORT: A single-processor parallel sorting algorithm. Journal of software 14(2), 159–165 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, L. (2005). Uniformization of Discrete Data. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_46
Download citation
DOI: https://doi.org/10.1007/11602613_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)