The Community for Technology Leaders
International Conference on Computer Supported Cooperative Work in Design (2009)
Santiago, Chile
Apr. 22, 2009 to Apr. 24, 2009
ISBN: 978-1-4244-3534-0
pp: 704-709
Wei Zhang , Faculty of Computer, Guangdong University of Technology, Guangzhou, China
Xiufen Fu , Faculty of Computer, Guangdong University of Technology, Guangzhou, China
Guigang Zheng , Faculty of Computer, Guangdong University of Technology, Guangzhou, China
Shaohua Teng , Faculty of Computer, Guangdong University of Technology, Guangzhou, China
ABSTRACT
Based on insertion, Quick-Sort and Merge-Sort algorithms, this paper proposes an improved method about indexing and presents its corresponding parallel algorithm. Introduction of index table increases memory consumption but decreases consumption of record movement in sorting. The experiment demonstrates that executing CPU time of indexingbased sort algorithm is evidently less than that of other sort algorithms. Based on index table and parallel computing, the Merge-Sort algorithm saved the waiting and disposal time in which every two sub-merging sequences are sorted in single processor computer. This obtained better efficiency than the original Merge-Sort algorithm.
INDEX TERMS
CITATION
Wei Zhang, Xiufen Fu, Guigang Zheng, Shaohua Teng, "A cooperative sort algorithm based on indexing", International Conference on Computer Supported Cooperative Work in Design, vol. 00, no. , pp. 704-709, 2009, doi:10.1109/CSCWD.2009.4968141
85 ms
(Ver )