Abstract
In this paper, we have a tendency to contemplate sorting drawback with n parts distributed over variety of process entities in a very distributed system. we've derived Associate in Nursing alternative, economical algorithmic program with the worst case lower bound of (n − 1) rounds for distributed sorting on a line network, wherever n is that the range of processors. The projected distributed algorithmic rule improves the performance of every processor while not making copies of (n − 2) parts at intermediate processors and reduces the execution time of Sasaki’s time−optimal algorithmic program [A.Sasaki, A time-optimal distributed algorithmic rule on a line network, Inform. Process Lett., 83(2002) pp. 21- 26]. additionally all processors don't essentially perform the disjoint comparison-exchange operations and simulation results show that the projected algorithmic program leads to higher execution time with the identity of processors.