TIME-SHARING OR PROPORTIONAL-SHARING: WHICH IS BETTER FOR MINIMUM MAKESPAN?

Resource sharing is an important issue for almost all applications. In this paper, we study communication link sharing strategies for application level scheduler on grids as well as heterogeneous and distributed characteristics. We assume that the link is shared via time-sharing or proportional-sharing. We build solution to solve this problem by linear programming, in rational numbers, which can be solved in polynomial time. Our preliminary results show that time-sharing scheme may achieve better performance than that of proportional-sharing.