Bandwidth-centric allocation of independent tasks on heterogeneous platforms

Citations Over TimeTop 10% of 2002 papers

Abstract

We consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a tree to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We define a base model, and show how to determine the maximum steady-state throughput of a node in the base model, assuming we already know the throughput of the subtrees rooted at the node's children. Thus, a bottom-up traversal of the tree determines the rate at which tasks can be processed in the full tree. The best allocation is bandwidth-centric: if enough bandwidth is available, then all nodes are kept busy; if bandwidth is limited, then tasks should be allocated only to the children which have sufficiently small communication times, regardless of their computation power.

Related Papers

• → Power Saving Bandwidth Allocation over GEO Satellite Networks(2012)47 cited
• → Novel bandwidth allocation with quota-based excess-distribution algorithm and wavelength assignment in multi-wavelength access network(2014)5 cited
• → A Novel Early DBA Mechanism with Prediction-Based Fair Excessive Bandwidth Allocation Scheme in EPON(2009)10 cited
• → Power Saving Bandwidth Allocation over GEO Satellite Networks(2012)2 cited
• → Trials of dynamic bandwidth allocation in ATM networks(2002)2 cited