A robust multi‐objective resource allocation scheme incorporating uncertainty and service differentiation
Alexander v. d. Kuijl, Michael Emmerich, Hui Li · Concurrency and Computation Practice and Experience · 2009
Abstract Grid computing emerges as an infrastructure for large‐scale data processing, resource sharing, and scientific computing. In this paper we propose a Grid scheduling algorithm using multi‐attribute utility theory and multi‐objective optimization (MOO). The algorithm makes the optimal decisions based on the available set of objectives. By comparing with a deadline‐and‐budget algorithm with three objectives, we show that the proposed MOO scheduling algorithm is capable of obtaining a broader set of non‐dominated solutions. The obtained solutions are also of higher quality, which are in close proximity to the Pareto optimal front. Copyright © 2009 John Wiley & Sons, Ltd.