A Novel Approach for O (1) Parallel Sorting Algorithm

Lamesginew Andargie, Gizachew Melkamu, Dr. Vuda Sreenivasarao

Abstract


Sorting is an algorithm of the most relevant operations performed on computers. In particular, it is a crucial tool when it comes to processing huge volumes of data into the memory. There are different types of sorting algorithms: simple sorting algorithms(such as insertion, selection and bubble)  and parallel sorting(such as parallel merge sort, Odd-even sorting, Bitonic sort and O(1) parallel sorting ) algorithm. Parallel sorting is the process of using multiple processing units to collectively sort an unordered sequence of data. In this paper is devoted to the discovery of new approach to O (1) parallel sorting algorithm, in which redundant data didn't taken into consideration yet.


Keywords


Sorting, Parallel Algorithm, O(1) Sorting Algorithm.

References


Ishwari S. R., Bhawnesh K., Tinku S.; "Performance Comparison of Sequential Quick Sort and Parallel Quick Sort Algorithms", International Journal of Computer Applications (0975 – 8887); Volume 57– No.9, November 2012

Kalim Qureshi, A Practical Performance Comparison of Parallel Sorting Algorithms on Homogeneous Network of Workstations, Kuwait University, Kuwait

NA Bitton, Avid J. Dewitt, and Avid k. Hsiao AND Jaishankar Menon, Taxonomy of Parallel Sorting, puting Surveys, Vol. 16, No. 3, September 1984.

Nancym. Amato, Ravishankariyer, Sharadsundaresan, Yanwu A Comparison of Parallel Sorting Algorithms on Different Architectures. Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, January 1996.

Friedhelm Meyer auf der Hede Avi Wigderson, The Complexity of Parallel Sorting,IBM Research Labratory, San Jose.

David R. Helman, David A. Bader, Joseph J´ aJ´azy, A Randomized Parallel Sorting Algorithm /with an Experimental Study

Davide Pasetto Albert Akhriev. A Comparative Study of Parallel Sort Algorithms IBM Dublin Research Lab, Mulhuddart, Dublin 15, Ireland

B. Wilkinson & M. Allen, Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., 2004 Pearson Education Inc.

Thomas Anastasio Bitonic Sorting December 4, 2003

Laxmikant V. Kale, Sanjeev Krishnan, A comparison based parallel sorting algorithm, University of Illinois, Urbana

Yingxu Wang, A New Sort Algorithm: Self-Indexed Sort,Communications of ACM SIGPALN, Vol.31, No.3, March, 1996, ACM, pp.28-36

David R. Cheng, Viral B. Shah John R. Gilbert, Alan Edelman A Novel Parallel Sorting Algorithm for Contemporary Architectures, May 20, 2007

G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. ZaghaAn Experimental Analysis of Parallel Sorting Algorithms, Theory Computing Systems31, 135–167 (1998)

Sanguthevar R., On Parallel Integer Sorting, University of Pennsylvania, Sandeep Sen

Jariya Phongsai , Research Paper on Sorting Algorithms, October 26, 2009

Pooja Adhikari, Review On Sorting Algorithms A comparative study on two sorting algorithms, Mississippi State, Mississippi, December 2007

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivestand Clifford Stein. Introduction to Algorithms Third Edition.


Full Text: PDF [FULL TEXT]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â