The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2007 vol.18)
pp: 1420-1435
ABSTRACT
In this paper, we consider the task allocation problem for computing a large set of equal-sized independent tasks on a heterogeneous computing system where the tasks initially reside on a single computer (the root) in the system. This problem represents the computation paradigm for a wide range of applications such as SETI@home and Monte Carlo simulations. We consider the scenario where the systems have a general graph-structured topology, and the computers are capable of concurrent communications and overlapping communications with computation. We show that the maximization of system throughput reduces to a standard network flow problem. We then develop a decentralized adaptive algorithm that solves a relaxed form of the standard network flow problem and maximizes the system throughput. This algorithm is then approximated by a simple decentralized protocol to coordinate the resources adaptively. Simulations are conducted to verify the effectiveness of the proposed approach. For both uniformly distributed and power law distributed systems, close-to-optimal throughput is achieved and improved performance over a bandwidth-centric heuristic is observed. The adaptivity of the proposed approach is also verified through simulations.
CITATION
Bo Hong, Viktor Prasanna, "Adaptive Allocation of Independent Tasks to Maximize Throughput", IEEE Transactions on Parallel & Distributed Systems, vol.18, no. 10, pp. 1420-1435, October 2007, doi:10.1109/TPDS.2007.1042
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool