Bandwidth-Constrained Allocation in Grid Computing

Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, commonly used for utilities (electricity and water). We model such a system as a capacitated graph, and study a basic allocation problem: given a set of jobs, each demanding computing and bandwidth resources and yielding a profit, determine which feasible subset of jobs yields the maximum total profit.

• Type: Journal
• Year: 2008
• Where: ALGORITHMICA
• Authors: Anshul Kothari, Subhash Suri, Yunhong Zhou
• Keywords: ALGORITHMICA 2008, Basic Allocation Problem, Grid Computing Systems, Virtual Computing Reservoir