Efficiency measurement of distributed statistical sorting algorithms

A.W.S. LOO; C.W. CHUNG; R.S.W. FU; M.S.K. CHAN; J. LO

Efficiency measurement of distributed statistical sorting algorithms

A.W.S. LOO, C.W. CHUNG, R.S.W. FU, M.S.K. CHAN, J. LO

Lingnan College

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

Abstract

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.

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

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

@inbook{5659e8a39eb149fe97e75656ca70554e,

title = "Efficiency measurement of distributed statistical sorting algorithms",

abstract = "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.",

author = "A.W.S. LOO and C.W. CHUNG and R.S.W. FU and M.S.K. CHAN and J. LO",

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.",

year = "1995",

language = "English",

isbn = "9781853123207",

pages = "19--25",

editor = "H. POWER",

booktitle = "Applications of high performance computing in engineering IV",

publisher = "Computational Mechanics Publications",

}

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 -

Efficiency measurement of distributed statistical sorting algorithms

Abstract

Bibliographical note

Fingerprint

Cite this