This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Analytic/Empirical Study of Distributed Sorting on a Local Area Network
May 1989 (vol. 15 no. 5)
pp. 575-586

A model for distributed sorting on a local area network (LAN) is presented. This model, contrary to the conventional model, takes into account both local processing time and communication time. This model is intended to provide a framework within which the performances of various distributed sorting algorithms are analyzed and implemented on Ethernet-connected Sun workstations. The empirical results by and large agree with the predictions derivable from the model. They show that local processing, particularly sorting of local subfiles, dominates the whole process, as far as response time is concerned. All algorithms examined have similar asymptotic behavior for large files. For medium-sized files, the degree of communication parallelism has a great impact on algorithm performance.

[1] D. Bitton, D. J. Dewitt, D. K. Hsiao, and J. Menon, "A taxonomy of parallel sorting,"Comput. Surveys, vol. 16, pp. 287-318, 1984.
[2] E. J. H. Chang, "Decentralized algorithms in distributed systems," Comput. Syst. Res. Group, Univ. Toronto, Tech. Rep. CSRG-103, June 1979.
[3] D. R. Cheriton, "The V kernel: A software base for distributed systems,"IEEE Software, vol. 1, no. 2, Apr. 1984.
[4] M. J. Carey and H. Lu, "Load balancing in locally distributed database system," inProc. SIGMOD '86 Int. Conf. Management Data, ACM, May 1986.
[5] N. P. Kronenberg, H. M. Levy, and W. D. Strecker, "VAXcluster: A closely-coupled distributed system,"ACM Trans. Comput. Syst., vol. 4., no. 2, pp. 130-146, May 1986.
[6] E. Lazowaka, J. Zahorjan, D. Cheriton, and W. Zwaenepoel, "File access performance of diskless workstations,"ACM Trans. Comput. Syst., vol. 4, no. 3, Aug. 1986.
[7] K. A. Lantz, W. I. Nowicki, and M. M. Theimer, "An empirical study of distributed application performance,"IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1162-1174, Oct. 1985.
[8] A. L. Liestman and P. G. Peters, "Distributed algorithms," School Comput. Sci., Simon Fraser Univ., Burnaby, B.C., Canada, Tech. Rep. TR-86-10, June 1986.
[9] J. Menon, "A study of sort algorithms for multiprocessor database machines,"Proc. Int. Conf. Very Large Data Bases, 1986, p. 197.
[10] T. W. Page, Jr. and G. J. Popek, "Distributed data management in local area networks," inProc. 3rd ACM Symp. Principles Database Sys., ACM-SIGACT-SIGMOD, Mar. 1985.
[11] D. Rotem, N. Santoro, and J. Sidney, "Distributed sorting,"IEEE Trans. Comput., vol. C-34, Apr. 1985.
[12] M. Salehmohammed, "Experimental analysis of LAN sorting algorithms," Master's thesis, Simon Fraser Univ., Burnaby, B.C., Canada, 1986.
[13] N. Santoro and J. B. Sidney, "Communication bounds for selection in distributed sets,"School Comput. Sci., Carleton Univ., Ottawa, Ont., Canada, Tech. Rep. SCS-TR-10, Sept. 1982.
[14] J. F. Shoch and J. A. Hupp, "Measured performance of an Ethernet local area network,"Commun. ACM, vol. 23, no. 12, pp. 711-721, 1980.
[15] M. Salehmohammond, W. S. Luk, and J. G. Peters, "Performance evaluation of LAN sorting Algorithms," inProc. 1987 Conf. Measurement Modeling Comput. Syst., ACM-SIGMETRICS, May 1987.
[16] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, Feb. 1971.
[17] L. M. Wegner, "Sorting a distributed file,"Comput. Networks, no. 8, Aug. 1984.

Index Terms:
local area network; LAN; local processing time; communication time; distributed sorting algorithms; Ethernet-connected Sun workstations; local processing; local subfiles; asymptotic behavior; large files; communication parallelism; algorithm performance; distributed processing; local area networks; sorting
Citation:
W.S. Luk, F. Ling, "An Analytic/Empirical Study of Distributed Sorting on a Local Area Network," IEEE Transactions on Software Engineering, vol. 15, no. 5, pp. 575-586, May 1989, doi:10.1109/32.24707
Usage of this product signifies your acceptance of the Terms of Use.