Algorithms for distributed sorting and prefix computation in static ad hoc mobile networks

Distributed processes with message passing strategy, communicate among themselves by exchanging pieces of information to perform exclusive access to achieve the tasks in a distributed fashion. In this paper, we consider sorting and prefix computation problems with n elements distributed over a number of communication processors in a distributed system. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of elements at intermediate processors. Also all processors do not necessarily perform the disjoint comparison exchange operations and the proposed algorithm works with the identity of processors. The proposed algorithms are based on token based message passing strategy for distributed sorting and prefix computation problems on static ad hoc mobile networks. These algorithms could possibly be extended to dynamic ad hoc mobile networks.

[1]  Greg N. Frederickson,et al.  Tradeoffs for selection in distributed networks (Preliminary Version) , 1983, PODC '83.

[2]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[3]  Yi Pan,et al.  Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system , 1998, Future Gener. Comput. Syst..

[4]  David S. L. Wei,et al.  Computer Algorithms , 1998, Scalable Comput. Pract. Exp..

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

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

[7]  Atsushi Sasaki.  A time-optimal distributed sorting algorithm on a line network , 2002, Inf. Process. Lett..

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

[9]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[11]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[12]  Nitin H. Vaidya,et al.  A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks , 2001, Wirel. Networks.

[13]  Yin-Te Tsai,et al.  An efficient external sorting algorithm , 2000, Inf. Process. Lett..

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

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

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

[17]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[18]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[19]  Lionel M. Ni,et al.  Reliable distributed sorting through the application-oriented fault tolerance paradigm , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.