Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput
By: Hong, B.; Prasanna, V.K.;
2003 / IEEE / 0-7695-2017-0
This item was taken from the IEEE Conference ' 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.
Monte Carlo Methods
Heterogeneous Computing Systems
Monte Carlo Simulation
Linear Programming Formulation
Network Flow Representation
Maximum Flow Algorithm
Minimum Cut Algorithm