This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 13th International Conference on Computer Supported Cooperative Work in Design
A cooperative sort algorithm based on indexing
Santiago, Chile
April 22-April 24
ISBN: 978-1-4244-3534-0
Guigang Zheng, Faculty of Computer, Guangdong University of Technology, Guangzhou, China
Shaohua Teng, Faculty of Computer, Guangdong University of Technology, Guangzhou, China
Wei Zhang, Faculty of Computer, Guangdong University of Technology, Guangzhou, China
Xiufen Fu, Faculty of Computer, Guangdong University of Technology, Guangzhou, China
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.
Citation:
Guigang Zheng, Shaohua Teng, Wei Zhang, Xiufen Fu, "A cooperative sort algorithm based on indexing," cscwd, pp.704-709, 2009 13th International Conference on Computer Supported Cooperative Work in Design, 2009
Usage of this product signifies your acceptance of the Terms of Use.