A robust multi‐objective resource allocation scheme incorporating uncertainty and service differentiation | Zendy

Kuijl Alexander v. d. | Zendy; Emmerich Michael T. M. | Zendy; Li Hui | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A robust multi‐objective resource allocation scheme incorporating uncertainty and service differentiation

Author(s) -

Kuijl Alexander v. d.,

Emmerich Michael T. M.,

Li Hui

Publication year - 2010

Publication title -

concurrency and computation: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.309

H-Index - 67

eISSN - 1532-0634

pISSN - 1532-0626

DOI - 10.1002/cpe.1481

Subject(s) - computer science , mathematical optimization , grid , scheduling (production processes) , multi objective optimization , pareto principle , pareto optimal , quality of service , grid computing , set (abstract data type) , scheme (mathematics) , resource allocation , distributed computing , operations research , mathematics , computer network , geometry , programming language , mathematical analysis

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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research