New Algorithms for Distributed Sorting in Distributed Systems

Muaayed F. Alrawi

This paper presents four algorithms to solve the distributed sorting problem in n-nodes distributed systems. Each algorithm consists of two phases. Phase (1) called "Distributed n-Selection Algorithm", which is used to find all the (i*C) smallest required keys value. Phase (2) called "Records Migration Algorithm", which is used to transfer records to their appropriate nodes. Algorithm (3) has the message complexity of O(n^(3) log N/n) in phase (1), in addition to O(n) in phase (2), while algorithm 1, 2, and 4 have a message complexity O(n^2 log N/n) in phase (1), in addition to O(n) in phase (2) to sort a file F of cardinality N over a system of size n-nodes

Select Volume / Issues:

• Volume 8,Issue 3, May 2017

Year:

2017

Type of Publication:

Article

Keywords:

Sorting; Distributed System; Algorithms

Journal:

IJECCE

Volume:

8

Number:

3

Pages:

199-207

Month:

May

ISSN:

2249-071X