A Comparison of Efficient Algorithms for Scheduling Parallel Data Redistribution
Marios-Evangelos Kogias, Timotheos Aslanidis · International journal of Computer Networks & Communications · 2014
Data redistribution in parallel is an often-addressed issue in modern computer networks.In this context, we study the case of data redistribution over a switching network.Data from the source stations need to be transferred to the destination stations in the minimum time possible.Unfortunately the time required to complete the transfer is burdened by each switching and thus producing an optimal schedule is proven to be computationally intractable.For the purposes of this paper we consider two algorithms, which have been proved to be very efficient in the past.To get improved results in comparison to previous approaches, we propose splitting the data in two clusters depending on the size of the data to be transferred.To prove the efficiency of our approach we ran experiments on all three algorithms, comparing the time span of the schedules produced as well as the running times to produce those schedules.The test cases we ran indicate that not only our newly proposed algorithm yields better results in terms of the schedule produced but runs faster as well.