Large amounts of data processing bring parallel computing into sharp focus. In order to solve the sorting problem of large-scale data in the era of internet, a large-scale distributed sorting algorithm based on cloud computing is proposed. The algorithm uses the ideas of quick-sort and merge-sort to sort and integrate the data on each cloud, which making best of clouds’ computing and storage resources. Taking advantage of the idea of parallel computing, we can reduce the computing time and improve the efficiency of sorting. By evaluating algorithm’s time complexity and organizing a simulation test, the effectiveness was verified.
CITATION STYLE
Pang, N., Zhu, D., Fan, Z., Rong, W., & Feng, W. (2015). A large-scale distributed sorting algorithm based on cloud computing. In Communications in Computer and Information Science (Vol. 557, pp. 226–237). Springer Verlag. https://doi.org/10.1007/978-3-662-48683-2_20
Mendeley helps you to discover research relevant for your work.