This paper presents the evaluation results of a distributed sorting algorithm which was presented by the authorsflO]. The evaluation is done by simulation. The algorithm makes use of the statistical properties of the data file. The objective of the algorithm is to minimize the number of messages required for the whole sorting process. The algorithm is designed to sort a very large file which is physically distributed over many sites (work-stations). The file size is so large that it is not feasible to transfer all data to a single node as no node has sufficient memory space for internal sorting. The sorting work will be shared by all sites involved and data will be sent along the lines communicating in bulk.
|Title of host publication||Applications of high performance computing in engineering IV|
|Place of Publication||United Kingdom|
|Publisher||Computational Mechanics Publications|
|Number of pages||7|
|Publication status||Published - 1995|
Bibliographical notePaper presented at the 4th International Conference on Applications of High-Performance Computing in Engineering, ASE 95, held in Milan, Italy, 19-21 June 1995, organised by the Wessex Institute of Technology, Southampton, UK.
LOO, A. W. S., CHUNG, C. W., FU, R. S. W., CHAN, M. S. K., & LO, J. (1995). Efficiency measurement of distributed statistical sorting algorithms. In H. POWER (Ed.), Applications of high performance computing in engineering IV (pp. 19-25). Computational Mechanics Publications.