Experimental evaluation of on-line routing-scheduling algorithms in distributed systems

摘要

Both the scheduling problem and the routing problem are important load-balancing problems in distributed Systems. In generally, the scheduling problem and the routing problem are dealt with separately so far. In this paper, we propose algorithms to solve the on-line routing-scheduling problem which aims to minimize the load of both communication and processing based on an on-line scheme. We show experimental comparison of proposed algorithms with previous methods. In our experimental results, proposed algorithms outperform the previous method, in which the scheduling problem and the routing problem were treated separately.