### Abstract

Original language | English |
---|---|

Title of host publication | Applications of high performance computing in engineering IV |

Editors | H. POWER |

Place of Publication | United Kingdom |

Publisher | Computational Mechanics Publications |

Pages | 19-25 |

Number of pages | 7 |

ISBN (Print) | 9781853123207 |

Publication status | Published - 1995 |

### Fingerprint

### Bibliographical note

Paper 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.### Cite this

*Applications of high performance computing in engineering IV*(pp. 19-25). United Kingdom: Computational Mechanics Publications.

}

*Applications of high performance computing in engineering IV.*Computational Mechanics Publications, United Kingdom, pp. 19-25.

**Efficiency measurement of distributed statistical sorting algorithms.** / LOO, A.W.S.; CHUNG, C.W.; FU, R.S.W.; CHAN, M.S.K.; LO, J.

Research output: Book Chapters | Papers in Conference Proceedings › Book Chapter

TY - CHAP

T1 - Efficiency measurement of distributed statistical sorting algorithms

AU - LOO, A.W.S.

AU - CHUNG, C.W.

AU - FU, R.S.W.

AU - CHAN, M.S.K.

AU - LO, J.

N1 - Paper 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.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

M3 - Book Chapter

SN - 9781853123207

SP - 19

EP - 25

BT - Applications of high performance computing in engineering IV

A2 - POWER, H.

PB - Computational Mechanics Publications

CY - United Kingdom

ER -