Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput

We consider the resource allocation problem for computing a large set of equal-sized independent tasks on heterogeneous computing systems. This problem represents the computation paradigm for a wide range of applications such as SETI@home and Monte Carlo simulations. We consider a general problem in which the interconnection between the nodes is modeled using a graph. We maximize the throughput of the system by using a linear programming formulation. This linear programming formulation is further transformed to an extended network flow representation, which can be solved efficiently using maximum flow/minimum cut algorithms. This leads to a simple distributed protocol for the problem. The effectiveness of the proposed resource allocation approach is verified through simulations

[1]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[2]  Francine Berman,et al.  Master/slave computing on the Grid , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[3]  Larry Carter,et al.  Bandwidth-centric allocation of independent tasks on heterogeneous platforms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[4]  Henri E. Bal,et al.  Efficient load balancing for wide-area divide-and-conquer applications , 2001, PPoPP '01.

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[6]  Bharadwaj Veeravalli,et al.  Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks , 2004, Cluster Computing.

[7]  Alan D. George,et al.  Parallel and Sequential Job Scheduling in Heterogeneous Clusters: A Simulation Study Using Software in the Loop , 2001, Simul..

[8]  Jon B. Weissman,et al.  Scheduling multi-component applications in heterogeneous wide-area networks , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[9]  Craig A. Lee,et al.  Cluster performance and the implications for distributed, heterogeneous grid performance , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[10]  Miron Livny,et al.  Evaluation of an Adaptive Scheduling Strategy for Master-Worker Applications on Clusters of Workstations , 2000, HiPC.

[11]  Miron Livny,et al.  Condor and the Grid , 2003 .

[12]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[13]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[14]  David P. Anderson,et al.  SETI@home-massively distributed computing for SETI , 2001, Comput. Sci. Eng..

[15]  Francine Berman,et al.  Overview of the Book: Grid Computing – Making the Global Infrastructure a Reality , 2003 .