Article ID: | iaor20097262 |
Country: | United States |
Volume: | 52 |
Issue: | 4 |
Start Page Number: | 487 |
End Page Number: | 501 |
Publication Date: | Dec 2008 |
Journal: | Algorithmica |
Authors: | Suri Subhash, Kothari Anshul, Zhou Yunhong |
Keywords: | computers: information |
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can “draw” resources from this reservoir 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.