A time-optimal distributed sorting algorithm on a line network

We have achieved a strict lower time bound of n -1 for distributed sorting on a line network, where n is the number of processes. The lower time bound has traditionally been considered to be n because it is proved based on the number of disjoint comparison-exchange operations in parallel sorting on a linear array. Our result has overthrown the traditional common belief.

[1]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  H. Peter Hofstee,et al.  Distributed Sorting , 1990, Sci. Comput. Program..

[3]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[4]  Nicola Santoro,et al.  Distributed Sorting , 1985, IEEE Transactions on Computers.

[5]  Lionel M. Ni,et al.  Reliable Distributed Sorting Through the Application-Oriented Fault Tolerance Paradigm , 1989, IEEE Trans. Parallel Distributed Syst..

[6]  Sébastien Tixeuil,et al.  A fault-tolerant distributed sorting algorithm in tree networks , 1998, 1998 IEEE International Performance, Computing and Communications Conference. Proceedings (Cat. No.98CH36191).

[7]  Wo-Shun Luk,et al.  An Analytic/Empirical Study of Distributed Sorting on a Local Area Network , 1989, IEEE Trans. Software Eng..

[8]  Michael C. Loui.  The Complexity of Sorting on Distributed Systems , 1984, Inf. Control..

[9]  Shmuel Zaks,et al.  Optimal Distributed Algorithms for Sorting and Ranking , 1985, IEEE Transactions on Computers.

[10]  Eli Gafni,et al.  Distributed Sorting Algorithms for Multi-Channel Broadcast Networks , 1987, Theor. Comput. Sci..

[11]  Ori Gerstel,et al.  The Bit Complexity of Distributed Sorting , 1997, Algorithmica.