Efficiency Measurement Of Distributed Statistical Sorting Algorithms
Price
Free (open access)
Volume
11
Pages
7
Published
1995
Size
441 kb
Paper DOI
10.2495/ASE950031
Copyright
WIT Press
Author(s)
A.W.S. Loo, C.W. Chung, R.S.W. Fu, M.S.K. Chan & J. Lo
Abstract
Efficiency measurement of distributed statistical sorting algorithms A.W.S. Loo, C.W. Chung, R.S.W. Fu, M.S.K. Chan, J. Lo 75 Stubbs Road, Hong Kong 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. The Distributed System Model The model was presented in [10] and is described again for easy reference as follows : - a large file i
Keywords