Sensitivity Analysis of Database Operations: A Case Study of Parallel Partition/Sorting Algorithm

A. Loo

References

  1. [1] O. Astrachan, Bubble sort: An archaeological algorithmicanalysis, Proc. 34th Technical Symp. on Computer ScienceEducation, Reno, NV, February 2002, 1–5.
  2. [2] S. Roosta, Parallel processing and parallel algorithm: Theoryand computation (New York: Springer, 2000).
  3. [3] K. Moreland, B. Wylie, & C. Pavlakos, Sort-last parallel rendering for viewing extremely large data sets on the displays, Proc. IEEE 2001 Symp. on Parallel and Large-Data Visualization and Graphics, San Diego, CA, October 2001, 85–92. doi:10.1109/PVGS.2001.964408
  4. [4] J. Claussen, A. Kemper, D. Kosssmann, & C. Wiesner, Exploiting early sorting and early partitioning for decision supportquery processing, The VLDB Journal, 9 (3), 2000, 190–213. doi:10.1007/s007780000030
  5. [5] Y. Matias, E. Segal, & J. Vitter, Efficient bundle sorting, Proc.11th Annual ACM-SIAM Symp. on Discrete Algorithms, SanFrancisco, CA, February 2000, 839–848.
  6. [6] A. Levitin, Introduction to the design and analysis of algorithms(Boston, MA: Addison Welsey, 2003).
  7. [7] H. Mahmoud, dSorting: A distribution theory (New York:John Wiley & Sons, 2000).
  8. [8] M. Ciura, Best increments for the average case of Shellsort,13th Int. Symp. on Fundamentals of Computation Theory,Riga, Latvia, August 2001, 106–117. doi:10.1007/3-540-44669-9_12
  9. [9] T. Standish, Data structures in Java (Reading, MA: AddisonWelsey, 2000).
  10. [10] T. Budd, Classic data structures in Java (Reading, MA:Addison Welsey, 2001).
  11. [11] W. Dobosiewicz, Sorting by distributive partitioning, Information Processing Letter, 7, 1978, 1-6. doi:10.1016/0020-0190(78)90028-5
  12. [12] W. Dobosiewicz, Linear probing sort, The Computer Journal,34 (4), 1991, 370-373.
  13. [13] L. Abdel-Malek & N. Asadathorn, Process and design tolerancein relation to manufacturing cost: A review & extension,Engineering Economist, 40 (1), 1994, 73-100. doi:10.1080/00137919408903139
  14. [14] R. Babyak, Predicting defects, Appliance Manufacturer,42 (11), 1994, 56-57.
  15. [15] M. Schilling, Is human height bimodal?, The American Statistician, 56 (3), 2002. doi:10.1198/00031300265
  16. [16] N. Yousif & D. Evans, Parallel distributive partitioned sortingmethods, International Journal of Computer Mathematics, 15,1984, 231-255. doi:10.1080/00207168408803412
  17. [17] M.T. Noga, Sorting in parallel by double distributive partitioning, BIT, 27, 1987, 340-348. doi:10.1007/BF01933729
  18. [18] A. Loo, Application of ’key distribution’ in very large database,Proc. Int. ASME Conference, Brighton, U.K., July 1989, 165-169.
  19. [19] A. Loo, Statistical sorting algorithms, ASME Review, 18 (3),1991, 55-63.
  20. [20] G. Grimmett & D. Stirzaker, Probability and random processes(Oxford, UK: Oxford University Press, 2001).
  21. [21] O. Ian, Programming classics: Implementing the world’s bestalgorithms (London, UK: Prentice Hall, 1993).
  22. [22] M. Quinn, Parallel sorting algorithms for tightly coupledmultiprocessors, Parallel Computing, 6 (3), 1988, 349–357. doi:10.1016/0167-8191(88)90075-0
  23. [23] G. Akl, Parallel sorting algorithms (Orlando, FL: AcademicPress, 1985).
  24. [24] P. Janus & E. Lamagna, An adaptive method for unknowndistributions in distributive partitioned sorting, IEEE Transactions on Computer, c-34 (4), 1985, 367-371.
  25. [25] M. Middleton, Data analysis using Excel (Pacific Grove, CA:Duxbury, 2000).
  26. [26] S. Lin, H. Wang, & C. Zhang, Statistical tolerance analysis based on beta distributions, Journal of Manufacturing Systems, 16(2), 1997, 150-158.

Important Links:

Go Back